/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:28:14,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:28:14,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:28:14,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:28:14,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:28:14,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:28:14,391 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:28:14,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:28:14,398 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:28:14,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:28:14,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:28:14,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:28:14,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:28:14,406 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:28:14,407 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:28:14,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:28:14,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:28:14,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:28:14,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:28:14,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:28:14,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:28:14,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:28:14,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:28:14,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:28:14,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:28:14,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:28:14,424 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:28:14,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:28:14,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:28:14,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:28:14,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:28:14,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:28:14,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:28:14,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:28:14,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:28:14,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:28:14,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:28:14,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:28:14,434 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:28:14,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:28:14,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:28:14,435 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:28:14,459 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:28:14,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:28:14,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:28:14,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:28:14,460 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:28:14,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:28:14,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:28:14,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:28:14,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:28:14,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:28:14,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:28:14,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:28:14,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:28:14,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:28:14,462 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:28:14,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:28:14,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:28:14,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:28:14,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:28:14,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:28:14,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:28:14,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:28:14,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 00:28:14,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:28:14,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:28:14,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:28:14,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:28:14,770 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:28:14,771 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 00:28:15,805 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:28:16,000 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:28:16,000 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-06 00:28:16,006 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c647087/f7dd39cf4d764b6da1bb54fd8b7e3240/FLAGf3a0f16b4 [2022-12-06 00:28:16,026 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c647087/f7dd39cf4d764b6da1bb54fd8b7e3240 [2022-12-06 00:28:16,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:28:16,030 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:28:16,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:28:16,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:28:16,036 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:28:16,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd433ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16, skipping insertion in model container [2022-12-06 00:28:16,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:28:16,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:28:16,220 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 00:28:16,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:28:16,238 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:28:16,259 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 00:28:16,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:28:16,274 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:28:16,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16 WrapperNode [2022-12-06 00:28:16,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:28:16,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:28:16,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:28:16,276 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:28:16,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,320 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-06 00:28:16,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:28:16,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:28:16,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:28:16,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:28:16,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,349 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:28:16,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:28:16,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:28:16,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:28:16,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (1/1) ... [2022-12-06 00:28:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:28:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:16,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 00:28:16,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 00:28:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:28:16,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:28:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:28:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:28:16,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:28:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:28:16,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:28:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:28:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 00:28:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:28:16,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:28:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:28:16,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:28:16,410 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 00:28:16,492 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:28:16,493 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:28:16,740 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:28:16,747 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:28:16,748 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:28:16,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:28:16 BoogieIcfgContainer [2022-12-06 00:28:16,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:28:16,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:28:16,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:28:16,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:28:16,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:28:16" (1/3) ... [2022-12-06 00:28:16,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:28:16, skipping insertion in model container [2022-12-06 00:28:16,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:28:16" (2/3) ... [2022-12-06 00:28:16,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ae052 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:28:16, skipping insertion in model container [2022-12-06 00:28:16,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:28:16" (3/3) ... [2022-12-06 00:28:16,762 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2022-12-06 00:28:16,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:28:16,785 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:28:16,785 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:28:16,897 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 00:28:16,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 350 flow [2022-12-06 00:28:17,029 INFO L130 PetriNetUnfolder]: 15/165 cut-off events. [2022-12-06 00:28:17,029 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:17,033 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 00:28:17,033 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 167 transitions, 350 flow [2022-12-06 00:28:17,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 157 transitions, 326 flow [2022-12-06 00:28:17,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:17,059 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-06 00:28:17,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 157 transitions, 326 flow [2022-12-06 00:28:17,104 INFO L130 PetriNetUnfolder]: 15/157 cut-off events. [2022-12-06 00:28:17,104 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:17,106 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 00:28:17,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 157 transitions, 326 flow [2022-12-06 00:28:17,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 2592 [2022-12-06 00:28:21,806 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 00:28:21,816 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:28:21,821 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;@181f7ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:28:21,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 00:28:21,824 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 00:28:21,824 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:21,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:21,825 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:21,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:21,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1887355417, now seen corresponding path program 1 times [2022-12-06 00:28:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:21,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023144708] [2022-12-06 00:28:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:21,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:22,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023144708] [2022-12-06 00:28:22,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023144708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:22,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:22,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:28:22,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548744470] [2022-12-06 00:28:22,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:22,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:22,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:22,254 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 00:28:22,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:22,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 00:28:22,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:22,313 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-06 00:28:22,313 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 00:28:22,313 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 00:28:22,315 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 00:28:22,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 00:28:22,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 00:28:22,325 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 00:28:22,327 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 00:28:22,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 00:28:22,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 00:28:22,331 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:22,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 00:28:22,336 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 00:28:22,337 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:22,337 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:22,340 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:22,340 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:22,341 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:22,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:22,346 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 00:28:22,346 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:28:22,347 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 00:28:22,347 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 00:28:22,347 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 00:28:22,994 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:22,995 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 658 [2022-12-06 00:28:22,995 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 00:28:22,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:22,996 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:22,996 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:22,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:28:22,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:22,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:22,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1661137616, now seen corresponding path program 1 times [2022-12-06 00:28:22,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:22,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443995002] [2022-12-06 00:28:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:23,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443995002] [2022-12-06 00:28:23,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443995002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:23,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:23,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 00:28:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662785729] [2022-12-06 00:28:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:23,098 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 00:28:23,098 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 00:28:23,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:23,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 00:28:23,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:23,145 INFO L130 PetriNetUnfolder]: 66/116 cut-off events. [2022-12-06 00:28:23,146 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:23,146 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 00:28:23,146 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 21 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2022-12-06 00:28:23,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 27 transitions, 119 flow [2022-12-06 00:28:23,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:23,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 00:28:23,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 00:28:23,149 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-06 00:28:23,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 27 transitions, 119 flow [2022-12-06 00:28:23,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 27 transitions, 111 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 00:28:23,150 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:23,150 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2022-12-06 00:28:23,151 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 00:28:23,151 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:23,151 INFO L89 Accepts]: Start accepts. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:23,152 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:23,152 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:23,152 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:23,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:23,156 INFO L130 PetriNetUnfolder]: 8/31 cut-off events. [2022-12-06 00:28:23,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:28:23,157 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 00:28:23,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:23,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 00:28:23,158 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:23,158 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 00:28:23,159 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2022-12-06 00:28:23,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:23,159 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:23,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:23,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:28:23,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005448, now seen corresponding path program 1 times [2022-12-06 00:28:23,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:23,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367236879] [2022-12-06 00:28:23,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:23,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367236879] [2022-12-06 00:28:23,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367236879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:23,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:23,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:28:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576205927] [2022-12-06 00:28:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:23,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:23,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:23,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:23,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 00:28:23,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:23,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:23,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 00:28:23,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:23,447 INFO L130 PetriNetUnfolder]: 85/169 cut-off events. [2022-12-06 00:28:23,447 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2022-12-06 00:28:23,448 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 00:28:23,448 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 30 selfloop transitions, 4 changer transitions 8/42 dead transitions. [2022-12-06 00:28:23,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 202 flow [2022-12-06 00:28:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 00:28:23,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-06 00:28:23,450 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 5 states and 41 transitions. [2022-12-06 00:28:23,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 202 flow [2022-12-06 00:28:23,451 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 00:28:23,451 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 85 flow [2022-12-06 00:28:23,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2022-12-06 00:28:23,452 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 00:28:23,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:23,452 INFO L89 Accepts]: Start accepts. Operand has 26 places, 21 transitions, 85 flow [2022-12-06 00:28:23,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:23,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:23,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 21 transitions, 85 flow [2022-12-06 00:28:23,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 85 flow [2022-12-06 00:28:23,457 INFO L130 PetriNetUnfolder]: 7/38 cut-off events. [2022-12-06 00:28:23,458 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-06 00:28:23,458 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 00:28:23,458 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 85 flow [2022-12-06 00:28:23,458 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 00:28:23,621 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:23,622 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 170 [2022-12-06 00:28:23,622 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 83 flow [2022-12-06 00:28:23,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:23,623 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:23,623 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:23,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:28:23,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:23,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:23,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1672318876, now seen corresponding path program 1 times [2022-12-06 00:28:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:23,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407363311] [2022-12-06 00:28:23,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:23,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407363311] [2022-12-06 00:28:23,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407363311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:23,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:23,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:23,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767918480] [2022-12-06 00:28:23,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:23,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:23,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:23,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:23,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:23,704 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 00:28:23,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:23,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:23,704 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 00:28:23,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:23,748 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-06 00:28:23,748 INFO L131 PetriNetUnfolder]: For 152/165 co-relation queries the response was YES. [2022-12-06 00:28:23,749 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 00:28:23,749 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 20 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2022-12-06 00:28:23,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 152 flow [2022-12-06 00:28:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:28:23,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 00:28:23,752 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 83 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:28:23,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 152 flow [2022-12-06 00:28:23,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 27 transitions, 135 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 00:28:23,753 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 66 flow [2022-12-06 00:28:23,753 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2022-12-06 00:28:23,754 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-06 00:28:23,754 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:23,754 INFO L89 Accepts]: Start accepts. Operand has 23 places, 19 transitions, 66 flow [2022-12-06 00:28:23,754 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:23,755 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:23,755 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 19 transitions, 66 flow [2022-12-06 00:28:23,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 66 flow [2022-12-06 00:28:23,758 INFO L130 PetriNetUnfolder]: 7/25 cut-off events. [2022-12-06 00:28:23,758 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 00:28:23,758 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 00:28:23,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 66 flow [2022-12-06 00:28:23,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-06 00:28:23,759 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:23,760 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 00:28:23,760 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 19 transitions, 66 flow [2022-12-06 00:28:23,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:23,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:23,760 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:23,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 00:28:23,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:23,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 526664714, now seen corresponding path program 1 times [2022-12-06 00:28:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720750451] [2022-12-06 00:28:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:23,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:23,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:23,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:23,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720750451] [2022-12-06 00:28:23,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720750451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:23,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:23,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647278115] [2022-12-06 00:28:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:23,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:23,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:23,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 00:28:23,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:23,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:23,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 00:28:23,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:23,892 INFO L130 PetriNetUnfolder]: 59/111 cut-off events. [2022-12-06 00:28:23,893 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 00:28:23,893 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 00:28:23,894 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-06 00:28:23,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 33 transitions, 175 flow [2022-12-06 00:28:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 00:28:23,895 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 00:28:23,895 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 66 flow. Second operand 4 states and 34 transitions. [2022-12-06 00:28:23,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 33 transitions, 175 flow [2022-12-06 00:28:23,896 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 00:28:23,897 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:23,897 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-06 00:28:23,898 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 00:28:23,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:23,899 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:23,900 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:23,900 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:23,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:23,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:23,903 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 00:28:23,903 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:28:23,904 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 00:28:23,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 83 flow [2022-12-06 00:28:23,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 00:28:24,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:24,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 208 [2022-12-06 00:28:24,107 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 81 flow [2022-12-06 00:28:24,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:24,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:24,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 00:28:24,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1844971348, now seen corresponding path program 1 times [2022-12-06 00:28:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253091786] [2022-12-06 00:28:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:24,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:24,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253091786] [2022-12-06 00:28:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253091786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:24,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:24,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65480695] [2022-12-06 00:28:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:28:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:28:24,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:28:24,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:28:24,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:24,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:24,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:28:24,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:24,220 INFO L130 PetriNetUnfolder]: 42/78 cut-off events. [2022-12-06 00:28:24,220 INFO L131 PetriNetUnfolder]: For 108/108 co-relation queries the response was YES. [2022-12-06 00:28:24,221 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 00:28:24,221 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 20 selfloop transitions, 2 changer transitions 1/23 dead transitions. [2022-12-06 00:28:24,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 23 transitions, 134 flow [2022-12-06 00:28:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:28:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:28:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 00:28:24,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 00:28:24,222 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 81 flow. Second operand 3 states and 24 transitions. [2022-12-06 00:28:24,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 23 transitions, 134 flow [2022-12-06 00:28:24,223 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 00:28:24,224 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 64 flow [2022-12-06 00:28:24,224 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2022-12-06 00:28:24,224 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 00:28:24,225 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:24,225 INFO L89 Accepts]: Start accepts. Operand has 24 places, 19 transitions, 64 flow [2022-12-06 00:28:24,225 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:24,225 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:24,225 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 19 transitions, 64 flow [2022-12-06 00:28:24,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 64 flow [2022-12-06 00:28:24,229 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 00:28:24,229 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 00:28:24,229 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 00:28:24,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 19 transitions, 64 flow [2022-12-06 00:28:24,230 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 00:28:24,230 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:24,231 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 00:28:24,231 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 64 flow [2022-12-06 00:28:24,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:24,231 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:24,231 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:24,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 00:28:24,232 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash -854334181, now seen corresponding path program 1 times [2022-12-06 00:28:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:24,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991001085] [2022-12-06 00:28:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:24,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:24,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991001085] [2022-12-06 00:28:24,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991001085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:24,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:24,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:24,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268189032] [2022-12-06 00:28:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:24,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:28:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:28:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:28:24,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:28:24,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:24,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:24,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:28:24,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:24,517 INFO L130 PetriNetUnfolder]: 52/94 cut-off events. [2022-12-06 00:28:24,517 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 00:28:24,517 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 00:28:24,518 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2022-12-06 00:28:24,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 137 flow [2022-12-06 00:28:24,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 00:28:24,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35526315789473684 [2022-12-06 00:28:24,520 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 64 flow. Second operand 4 states and 27 transitions. [2022-12-06 00:28:24,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 137 flow [2022-12-06 00:28:24,520 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 00:28:24,521 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 79 flow [2022-12-06 00:28:24,521 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 00:28:24,521 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 4 predicate places. [2022-12-06 00:28:24,522 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:24,522 INFO L89 Accepts]: Start accepts. Operand has 25 places, 20 transitions, 79 flow [2022-12-06 00:28:24,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:24,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:24,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-06 00:28:24,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 79 flow [2022-12-06 00:28:24,526 INFO L130 PetriNetUnfolder]: 8/29 cut-off events. [2022-12-06 00:28:24,527 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 00:28:24,527 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 00:28:24,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 79 flow [2022-12-06 00:28:24,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-06 00:28:24,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:24,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:28:24,535 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 79 flow [2022-12-06 00:28:24,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:24,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:24,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:24,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 00:28:24,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash -503744373, now seen corresponding path program 1 times [2022-12-06 00:28:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:24,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470375235] [2022-12-06 00:28:24,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:24,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 00:28:24,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:24,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470375235] [2022-12-06 00:28:24,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470375235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:24,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584140351] [2022-12-06 00:28:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:24,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:24,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:24,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 00:28:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:24,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 38 conjunts are in the unsatisfiable core [2022-12-06 00:28:24,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:25,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 00:28:25,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:25,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:25,199 INFO L321 Elim1Store]: treesize reduction 29, result has 58.0 percent of original size [2022-12-06 00:28:25,199 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 00:28:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:25,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:27,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584140351] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:27,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:27,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 16 [2022-12-06 00:28:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643992643] [2022-12-06 00:28:27,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:27,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:28:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:28:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=191, Unknown=3, NotChecked=0, Total=240 [2022-12-06 00:28:27,855 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:28:27,855 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 00:28:27,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:27,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:28:27,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:28,790 INFO L130 PetriNetUnfolder]: 143/256 cut-off events. [2022-12-06 00:28:28,791 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-06 00:28:28,791 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 00:28:28,792 INFO L137 encePairwiseOnDemand]: 9/19 looper letters, 50 selfloop transitions, 14 changer transitions 24/88 dead transitions. [2022-12-06 00:28:28,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 88 transitions, 488 flow [2022-12-06 00:28:28,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:28:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:28:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 91 transitions. [2022-12-06 00:28:28,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28173374613003094 [2022-12-06 00:28:28,794 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 79 flow. Second operand 17 states and 91 transitions. [2022-12-06 00:28:28,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 88 transitions, 488 flow [2022-12-06 00:28:28,795 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 00:28:28,804 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 156 flow [2022-12-06 00:28:28,804 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 00:28:28,805 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 00:28:28,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:28,805 INFO L89 Accepts]: Start accepts. Operand has 44 places, 28 transitions, 156 flow [2022-12-06 00:28:28,806 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:28,806 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:28,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 28 transitions, 156 flow [2022-12-06 00:28:28,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 156 flow [2022-12-06 00:28:28,811 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2022-12-06 00:28:28,811 INFO L131 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2022-12-06 00:28:28,812 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 00:28:28,812 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 156 flow [2022-12-06 00:28:28,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 00:28:31,173 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:31,174 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2369 [2022-12-06 00:28:31,174 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 156 flow [2022-12-06 00:28:31,174 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 00:28:31,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:31,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:31,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:31,375 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 00:28:31,375 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1982835261, now seen corresponding path program 1 times [2022-12-06 00:28:31,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:31,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719482642] [2022-12-06 00:28:31,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:31,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:31,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:31,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719482642] [2022-12-06 00:28:31,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719482642] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:31,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:31,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:31,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973731034] [2022-12-06 00:28:31,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:31,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:31,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:31,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:31,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:31,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:28:31,588 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 00:28:31,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:31,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:28:31,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:31,703 INFO L130 PetriNetUnfolder]: 99/187 cut-off events. [2022-12-06 00:28:31,704 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 00:28:31,704 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 00:28:31,705 INFO L137 encePairwiseOnDemand]: 17/22 looper letters, 26 selfloop transitions, 4 changer transitions 4/34 dead transitions. [2022-12-06 00:28:31,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 256 flow [2022-12-06 00:28:31,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:28:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:28:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-12-06 00:28:31,706 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3409090909090909 [2022-12-06 00:28:31,706 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 156 flow. Second operand 4 states and 30 transitions. [2022-12-06 00:28:31,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 256 flow [2022-12-06 00:28:31,708 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 00:28:31,709 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 146 flow [2022-12-06 00:28:31,709 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 00:28:31,709 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-06 00:28:31,709 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:31,709 INFO L89 Accepts]: Start accepts. Operand has 38 places, 27 transitions, 146 flow [2022-12-06 00:28:31,710 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:31,710 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:31,710 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 146 flow [2022-12-06 00:28:31,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 146 flow [2022-12-06 00:28:31,716 INFO L130 PetriNetUnfolder]: 13/50 cut-off events. [2022-12-06 00:28:31,717 INFO L131 PetriNetUnfolder]: For 32/35 co-relation queries the response was YES. [2022-12-06 00:28:31,717 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 00:28:31,717 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 146 flow [2022-12-06 00:28:31,717 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 00:28:31,738 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 00:28:32,132 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:28:32,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-06 00:28:32,133 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 140 flow [2022-12-06 00:28:32,133 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 00:28:32,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:32,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:32,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 00:28:32,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:32,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1626137748, now seen corresponding path program 1 times [2022-12-06 00:28:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:32,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774531778] [2022-12-06 00:28:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774531778] [2022-12-06 00:28:32,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774531778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:32,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:32,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:28:32,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311671884] [2022-12-06 00:28:32,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:32,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:28:32,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:32,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:28:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:28:32,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 00:28:32,503 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 00:28:32,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:32,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 00:28:32,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:32,637 INFO L130 PetriNetUnfolder]: 126/236 cut-off events. [2022-12-06 00:28:32,637 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2022-12-06 00:28:32,638 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 00:28:32,639 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 37 selfloop transitions, 6 changer transitions 16/59 dead transitions. [2022-12-06 00:28:32,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 59 transitions, 396 flow [2022-12-06 00:28:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:28:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:28:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 00:28:32,644 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-06 00:28:32,644 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 140 flow. Second operand 6 states and 56 transitions. [2022-12-06 00:28:32,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 59 transitions, 396 flow [2022-12-06 00:28:32,645 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 00:28:32,646 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 159 flow [2022-12-06 00:28:32,646 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 00:28:32,646 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2022-12-06 00:28:32,647 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:32,647 INFO L89 Accepts]: Start accepts. Operand has 40 places, 28 transitions, 159 flow [2022-12-06 00:28:32,649 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:32,650 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:32,650 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 159 flow [2022-12-06 00:28:32,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 159 flow [2022-12-06 00:28:32,657 INFO L130 PetriNetUnfolder]: 14/62 cut-off events. [2022-12-06 00:28:32,658 INFO L131 PetriNetUnfolder]: For 77/79 co-relation queries the response was YES. [2022-12-06 00:28:32,658 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 00:28:32,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 159 flow [2022-12-06 00:28:32,659 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 00:28:32,659 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:32,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 00:28:32,660 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 159 flow [2022-12-06 00:28:32,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:32,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:32,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:32,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 00:28:32,660 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:32,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1747909610, now seen corresponding path program 1 times [2022-12-06 00:28:32,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:32,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492741877] [2022-12-06 00:28:32,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:32,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:32,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492741877] [2022-12-06 00:28:32,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492741877] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:32,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369506627] [2022-12-06 00:28:32,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:32,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:32,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:32,743 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:32,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 00:28:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:32,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:28:32,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:32,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:32,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 00:28:32,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369506627] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:32,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:32,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-12-06 00:28:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382305362] [2022-12-06 00:28:32,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:32,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:28:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:32,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:28:32,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:28:32,952 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 00:28:32,953 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 00:28:32,953 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:32,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 00:28:32,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:33,191 INFO L130 PetriNetUnfolder]: 123/239 cut-off events. [2022-12-06 00:28:33,191 INFO L131 PetriNetUnfolder]: For 415/415 co-relation queries the response was YES. [2022-12-06 00:28:33,192 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 00:28:33,193 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 39 selfloop transitions, 4 changer transitions 10/53 dead transitions. [2022-12-06 00:28:33,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 363 flow [2022-12-06 00:28:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:33,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-12-06 00:28:33,194 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 00:28:33,194 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 159 flow. Second operand 5 states and 50 transitions. [2022-12-06 00:28:33,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 363 flow [2022-12-06 00:28:33,196 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 00:28:33,197 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 170 flow [2022-12-06 00:28:33,197 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 00:28:33,198 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2022-12-06 00:28:33,198 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:33,198 INFO L89 Accepts]: Start accepts. Operand has 43 places, 29 transitions, 170 flow [2022-12-06 00:28:33,199 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:33,199 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:33,199 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 29 transitions, 170 flow [2022-12-06 00:28:33,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 29 transitions, 170 flow [2022-12-06 00:28:33,206 INFO L130 PetriNetUnfolder]: 13/59 cut-off events. [2022-12-06 00:28:33,207 INFO L131 PetriNetUnfolder]: For 75/78 co-relation queries the response was YES. [2022-12-06 00:28:33,207 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 00:28:33,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 29 transitions, 170 flow [2022-12-06 00:28:33,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 00:28:33,743 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:33,744 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 546 [2022-12-06 00:28:33,744 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 158 flow [2022-12-06 00:28:33,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:33,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:33,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:33,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 00:28:33,945 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 00:28:33,945 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash 181150205, now seen corresponding path program 1 times [2022-12-06 00:28:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172417938] [2022-12-06 00:28:33,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:33,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:34,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:34,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172417938] [2022-12-06 00:28:34,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172417938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:34,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757802203] [2022-12-06 00:28:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:34,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:34,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:34,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:34,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 00:28:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:34,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 00:28:34,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:34,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:34,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757802203] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:34,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:34,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 00:28:34,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025040789] [2022-12-06 00:28:34,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:34,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:28:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:34,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:28:34,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:28:34,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:28:34,403 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 00:28:34,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:34,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:28:34,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:35,172 INFO L130 PetriNetUnfolder]: 250/457 cut-off events. [2022-12-06 00:28:35,173 INFO L131 PetriNetUnfolder]: For 1091/1091 co-relation queries the response was YES. [2022-12-06 00:28:35,174 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 00:28:35,175 INFO L137 encePairwiseOnDemand]: 13/22 looper letters, 81 selfloop transitions, 25 changer transitions 8/114 dead transitions. [2022-12-06 00:28:35,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 114 transitions, 866 flow [2022-12-06 00:28:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:28:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:28:35,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-12-06 00:28:35,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 00:28:35,177 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 158 flow. Second operand 14 states and 112 transitions. [2022-12-06 00:28:35,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 114 transitions, 866 flow [2022-12-06 00:28:35,179 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 00:28:35,180 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 379 flow [2022-12-06 00:28:35,180 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 00:28:35,181 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 36 predicate places. [2022-12-06 00:28:35,181 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:35,181 INFO L89 Accepts]: Start accepts. Operand has 57 places, 44 transitions, 379 flow [2022-12-06 00:28:35,182 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:35,182 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:35,182 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 379 flow [2022-12-06 00:28:35,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 44 transitions, 379 flow [2022-12-06 00:28:35,194 INFO L130 PetriNetUnfolder]: 38/132 cut-off events. [2022-12-06 00:28:35,194 INFO L131 PetriNetUnfolder]: For 280/288 co-relation queries the response was YES. [2022-12-06 00:28:35,195 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 00:28:35,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 44 transitions, 379 flow [2022-12-06 00:28:35,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 00:28:37,839 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:28:37,839 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2658 [2022-12-06 00:28:37,839 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 362 flow [2022-12-06 00:28:37,840 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 00:28:37,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:37,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:37,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:38,044 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 00:28:38,045 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1785931863, now seen corresponding path program 1 times [2022-12-06 00:28:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:38,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941699095] [2022-12-06 00:28:38,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:38,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:38,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941699095] [2022-12-06 00:28:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941699095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449968680] [2022-12-06 00:28:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:38,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:38,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:38,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:38,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 00:28:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:38,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-06 00:28:38,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:38,928 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 00:28:38,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:38,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:38,996 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 00:28:39,182 INFO L321 Elim1Store]: treesize reduction 65, result has 69.5 percent of original size [2022-12-06 00:28:39,183 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 00:28:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:42,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:42,834 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 00:28:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:43,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449968680] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:43,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:43,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-06 00:28:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819403355] [2022-12-06 00:28:43,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:43,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:28:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:28:43,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2022-12-06 00:28:43,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:28:43,271 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 00:28:43,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:43,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:28:43,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:43,522 INFO L130 PetriNetUnfolder]: 245/455 cut-off events. [2022-12-06 00:28:43,523 INFO L131 PetriNetUnfolder]: For 1483/1483 co-relation queries the response was YES. [2022-12-06 00:28:43,524 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 00:28:43,526 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 32 selfloop transitions, 5 changer transitions 21/58 dead transitions. [2022-12-06 00:28:43,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 557 flow [2022-12-06 00:28:43,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:43,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 00:28:43,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3565217391304348 [2022-12-06 00:28:43,527 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 362 flow. Second operand 5 states and 41 transitions. [2022-12-06 00:28:43,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 557 flow [2022-12-06 00:28:43,531 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 00:28:43,532 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 233 flow [2022-12-06 00:28:43,532 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 00:28:43,532 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 00:28:43,532 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:43,532 INFO L89 Accepts]: Start accepts. Operand has 58 places, 34 transitions, 233 flow [2022-12-06 00:28:43,533 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:43,533 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:43,533 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 34 transitions, 233 flow [2022-12-06 00:28:43,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 34 transitions, 233 flow [2022-12-06 00:28:43,541 INFO L130 PetriNetUnfolder]: 25/84 cut-off events. [2022-12-06 00:28:43,541 INFO L131 PetriNetUnfolder]: For 92/96 co-relation queries the response was YES. [2022-12-06 00:28:43,541 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 00:28:43,542 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 34 transitions, 233 flow [2022-12-06 00:28:43,542 INFO L188 LiptonReduction]: Number of co-enabled transitions 138 [2022-12-06 00:28:43,542 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:28:43,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 00:28:43,543 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 233 flow [2022-12-06 00:28:43,543 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 00:28:43,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:43,543 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:43,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:43,747 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 00:28:43,748 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1577182119, now seen corresponding path program 1 times [2022-12-06 00:28:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:43,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443666050] [2022-12-06 00:28:43,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:45,127 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 00:28:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:45,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443666050] [2022-12-06 00:28:45,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443666050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:45,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269269874] [2022-12-06 00:28:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:45,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:45,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:45,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:45,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 00:28:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:45,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 00:28:45,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:45,217 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-06 00:28:45,217 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 00:28:45,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:45,221 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 00:28:45,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:45,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:45,379 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 00:28:45,394 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 00:28:45,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:45,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 00:28:45,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269269874] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:45,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:45,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 00:28:45,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582022429] [2022-12-06 00:28:45,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:45,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-06 00:28:45,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:45,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-06 00:28:45,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=245, Unknown=2, NotChecked=0, Total=306 [2022-12-06 00:28:45,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 00:28:45,605 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 00:28:45,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:45,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 00:28:45,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:46,323 INFO L130 PetriNetUnfolder]: 419/774 cut-off events. [2022-12-06 00:28:46,324 INFO L131 PetriNetUnfolder]: For 1967/1967 co-relation queries the response was YES. [2022-12-06 00:28:46,325 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 00:28:46,327 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 90 selfloop transitions, 46 changer transitions 2/138 dead transitions. [2022-12-06 00:28:46,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 138 transitions, 1047 flow [2022-12-06 00:28:46,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:28:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:28:46,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-12-06 00:28:46,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2022-12-06 00:28:46,328 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 233 flow. Second operand 13 states and 112 transitions. [2022-12-06 00:28:46,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 138 transitions, 1047 flow [2022-12-06 00:28:46,331 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 00:28:46,335 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 627 flow [2022-12-06 00:28:46,335 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 00:28:46,336 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 37 predicate places. [2022-12-06 00:28:46,336 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:46,336 INFO L89 Accepts]: Start accepts. Operand has 58 places, 77 transitions, 627 flow [2022-12-06 00:28:46,338 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:46,338 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:46,338 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 77 transitions, 627 flow [2022-12-06 00:28:46,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 77 transitions, 627 flow [2022-12-06 00:28:46,359 INFO L130 PetriNetUnfolder]: 54/212 cut-off events. [2022-12-06 00:28:46,359 INFO L131 PetriNetUnfolder]: For 301/305 co-relation queries the response was YES. [2022-12-06 00:28:46,360 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 00:28:46,361 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 77 transitions, 627 flow [2022-12-06 00:28:46,361 INFO L188 LiptonReduction]: Number of co-enabled transitions 290 [2022-12-06 00:28:46,373 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 00:28:46,713 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 00:28:46,794 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 00:28:47,013 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 00:28:47,209 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:28:47,210 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 874 [2022-12-06 00:28:47,210 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 75 transitions, 649 flow [2022-12-06 00:28:47,210 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 00:28:47,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:47,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:47,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 00:28:47,415 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 00:28:47,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1573603369, now seen corresponding path program 1 times [2022-12-06 00:28:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:47,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405642971] [2022-12-06 00:28:47,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:48,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:48,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405642971] [2022-12-06 00:28:48,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405642971] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:48,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472496908] [2022-12-06 00:28:48,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:48,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:48,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:48,248 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:48,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 00:28:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:48,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-06 00:28:48,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:48,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 00:28:48,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 00:28:48,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:28:48,455 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-12-06 00:28:48,456 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 00:28:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:48,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:48,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472496908] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:48,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:48,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-06 00:28:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678677586] [2022-12-06 00:28:48,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:48,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:28:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:28:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=105, Unknown=1, NotChecked=0, Total=156 [2022-12-06 00:28:48,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 00:28:48,692 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 00:28:48,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:48,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 00:28:48,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:53,185 INFO L130 PetriNetUnfolder]: 437/804 cut-off events. [2022-12-06 00:28:53,186 INFO L131 PetriNetUnfolder]: For 2243/2243 co-relation queries the response was YES. [2022-12-06 00:28:53,187 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 00:28:53,190 INFO L137 encePairwiseOnDemand]: 11/25 looper letters, 77 selfloop transitions, 23 changer transitions 2/102 dead transitions. [2022-12-06 00:28:53,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 102 transitions, 977 flow [2022-12-06 00:28:53,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:28:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:28:53,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-06 00:28:53,192 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.285 [2022-12-06 00:28:53,192 INFO L175 Difference]: Start difference. First operand has 56 places, 75 transitions, 649 flow. Second operand 8 states and 57 transitions. [2022-12-06 00:28:53,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 102 transitions, 977 flow [2022-12-06 00:28:53,197 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 00:28:53,199 INFO L231 Difference]: Finished difference. Result has 68 places, 84 transitions, 734 flow [2022-12-06 00:28:53,200 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 00:28:53,200 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2022-12-06 00:28:53,200 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:53,200 INFO L89 Accepts]: Start accepts. Operand has 68 places, 84 transitions, 734 flow [2022-12-06 00:28:53,201 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:53,201 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:53,201 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 84 transitions, 734 flow [2022-12-06 00:28:53,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 84 transitions, 734 flow [2022-12-06 00:28:53,218 INFO L130 PetriNetUnfolder]: 56/214 cut-off events. [2022-12-06 00:28:53,219 INFO L131 PetriNetUnfolder]: For 478/487 co-relation queries the response was YES. [2022-12-06 00:28:53,219 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 00:28:53,220 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 84 transitions, 734 flow [2022-12-06 00:28:53,220 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 00:28:53,235 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 00:28:54,079 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 00:28:54,698 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 00:28:54,911 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 00:28:55,370 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 00:28:55,650 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 00:28:55,854 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:28:55,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2655 [2022-12-06 00:28:55,855 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 84 transitions, 809 flow [2022-12-06 00:28:55,855 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 00:28:55,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:55,855 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:55,866 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 00:28:56,060 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 00:28:56,062 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1541117875, now seen corresponding path program 1 times [2022-12-06 00:28:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450055773] [2022-12-06 00:28:56,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:56,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:56,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450055773] [2022-12-06 00:28:56,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450055773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:28:56,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:28:56,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:28:56,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132109576] [2022-12-06 00:28:56,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:28:56,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:28:56,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:56,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:28:56,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:28:56,829 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:28:56,829 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 00:28:56,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:56,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:28:56,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:57,027 INFO L130 PetriNetUnfolder]: 454/846 cut-off events. [2022-12-06 00:28:57,028 INFO L131 PetriNetUnfolder]: For 3003/3003 co-relation queries the response was YES. [2022-12-06 00:28:57,029 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 00:28:57,032 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 73 selfloop transitions, 27 changer transitions 4/104 dead transitions. [2022-12-06 00:28:57,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 1123 flow [2022-12-06 00:28:57,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:28:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:28:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 00:28:57,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-06 00:28:57,034 INFO L175 Difference]: Start difference. First operand has 68 places, 84 transitions, 809 flow. Second operand 5 states and 56 transitions. [2022-12-06 00:28:57,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 1123 flow [2022-12-06 00:28:57,038 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 00:28:57,040 INFO L231 Difference]: Finished difference. Result has 72 places, 86 transitions, 824 flow [2022-12-06 00:28:57,040 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 00:28:57,042 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 51 predicate places. [2022-12-06 00:28:57,042 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:57,042 INFO L89 Accepts]: Start accepts. Operand has 72 places, 86 transitions, 824 flow [2022-12-06 00:28:57,043 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:57,043 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:57,043 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 86 transitions, 824 flow [2022-12-06 00:28:57,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 86 transitions, 824 flow [2022-12-06 00:28:57,063 INFO L130 PetriNetUnfolder]: 57/229 cut-off events. [2022-12-06 00:28:57,063 INFO L131 PetriNetUnfolder]: For 680/684 co-relation queries the response was YES. [2022-12-06 00:28:57,063 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 00:28:57,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 86 transitions, 824 flow [2022-12-06 00:28:57,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 00:28:57,215 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 00:28:57,414 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:28:57,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 373 [2022-12-06 00:28:57,415 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 86 transitions, 846 flow [2022-12-06 00:28:57,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:28:57,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:28:57,415 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:28:57,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 00:28:57,415 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:28:57,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:28:57,416 INFO L85 PathProgramCache]: Analyzing trace with hash 897559288, now seen corresponding path program 1 times [2022-12-06 00:28:57,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:28:57,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77845978] [2022-12-06 00:28:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:28:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:28:58,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77845978] [2022-12-06 00:28:58,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77845978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:28:58,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335222793] [2022-12-06 00:28:58,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:28:58,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:28:58,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:28:58,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:28:58,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 00:28:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:28:58,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:28:58,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:28:58,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:28:58,350 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 00:28:58,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:58,411 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 00:28:58,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:58,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:28:58,525 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:58,525 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 00:28:58,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:28:58,558 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 00:28:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:28:59,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335222793] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:28:59,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:28:59,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:28:59,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282539213] [2022-12-06 00:28:59,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:28:59,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:28:59,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:28:59,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:28:59,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:28:59,189 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 00:28:59,189 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 00:28:59,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:28:59,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 00:28:59,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:28:59,909 INFO L130 PetriNetUnfolder]: 520/959 cut-off events. [2022-12-06 00:28:59,909 INFO L131 PetriNetUnfolder]: For 3666/3666 co-relation queries the response was YES. [2022-12-06 00:28:59,911 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 00:28:59,914 INFO L137 encePairwiseOnDemand]: 11/32 looper letters, 92 selfloop transitions, 43 changer transitions 4/139 dead transitions. [2022-12-06 00:28:59,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 139 transitions, 1429 flow [2022-12-06 00:28:59,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:28:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:28:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2022-12-06 00:28:59,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24147727272727273 [2022-12-06 00:28:59,915 INFO L175 Difference]: Start difference. First operand has 69 places, 86 transitions, 846 flow. Second operand 11 states and 85 transitions. [2022-12-06 00:28:59,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 139 transitions, 1429 flow [2022-12-06 00:28:59,921 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 00:28:59,922 INFO L231 Difference]: Finished difference. Result has 77 places, 102 transitions, 1071 flow [2022-12-06 00:28:59,922 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 00:28:59,923 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2022-12-06 00:28:59,923 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:28:59,923 INFO L89 Accepts]: Start accepts. Operand has 77 places, 102 transitions, 1071 flow [2022-12-06 00:28:59,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:28:59,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:28:59,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 102 transitions, 1071 flow [2022-12-06 00:28:59,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 102 transitions, 1071 flow [2022-12-06 00:28:59,946 INFO L130 PetriNetUnfolder]: 65/257 cut-off events. [2022-12-06 00:28:59,946 INFO L131 PetriNetUnfolder]: For 810/814 co-relation queries the response was YES. [2022-12-06 00:28:59,947 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 00:28:59,948 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 102 transitions, 1071 flow [2022-12-06 00:28:59,948 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 00:28:59,960 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 00:29:01,119 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:01,120 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1197 [2022-12-06 00:29:01,120 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 102 transitions, 1085 flow [2022-12-06 00:29:01,120 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 00:29:01,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:01,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:01,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:01,321 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 00:29:01,321 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:01,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -439053155, now seen corresponding path program 1 times [2022-12-06 00:29:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:01,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300279942] [2022-12-06 00:29:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:01,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:01,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:01,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300279942] [2022-12-06 00:29:01,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300279942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:01,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:01,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31352501] [2022-12-06 00:29:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:01,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:01,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:01,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:01,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:01,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:29:01,379 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 00:29:01,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:01,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:29:01,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:01,665 INFO L130 PetriNetUnfolder]: 572/1077 cut-off events. [2022-12-06 00:29:01,665 INFO L131 PetriNetUnfolder]: For 4936/4936 co-relation queries the response was YES. [2022-12-06 00:29:01,667 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 00:29:01,671 INFO L137 encePairwiseOnDemand]: 27/34 looper letters, 151 selfloop transitions, 15 changer transitions 7/173 dead transitions. [2022-12-06 00:29:01,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 173 transitions, 2069 flow [2022-12-06 00:29:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:29:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:29:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-12-06 00:29:01,672 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27310924369747897 [2022-12-06 00:29:01,672 INFO L175 Difference]: Start difference. First operand has 76 places, 102 transitions, 1085 flow. Second operand 7 states and 65 transitions. [2022-12-06 00:29:01,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 173 transitions, 2069 flow [2022-12-06 00:29:01,681 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 00:29:01,683 INFO L231 Difference]: Finished difference. Result has 83 places, 113 transitions, 1199 flow [2022-12-06 00:29:01,683 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 00:29:01,684 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 00:29:01,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:01,684 INFO L89 Accepts]: Start accepts. Operand has 83 places, 113 transitions, 1199 flow [2022-12-06 00:29:01,686 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:01,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:01,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 113 transitions, 1199 flow [2022-12-06 00:29:01,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 113 transitions, 1199 flow [2022-12-06 00:29:01,719 INFO L130 PetriNetUnfolder]: 78/311 cut-off events. [2022-12-06 00:29:01,719 INFO L131 PetriNetUnfolder]: For 1545/1554 co-relation queries the response was YES. [2022-12-06 00:29:01,720 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 00:29:01,722 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 113 transitions, 1199 flow [2022-12-06 00:29:01,722 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 00:29:01,725 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 00:29:01,802 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 00:29:02,121 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:02,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 437 [2022-12-06 00:29:02,122 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 112 transitions, 1210 flow [2022-12-06 00:29:02,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:02,122 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:02,122 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:02,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 00:29:02,122 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:02,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:02,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1743020586, now seen corresponding path program 1 times [2022-12-06 00:29:02,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:02,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112210902] [2022-12-06 00:29:02,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:02,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:02,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:02,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:02,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112210902] [2022-12-06 00:29:02,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112210902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:02,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:02,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882421479] [2022-12-06 00:29:02,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 00:29:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:02,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 00:29:02,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 00:29:02,938 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:29:02,939 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 00:29:02,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:02,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:29:02,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:03,239 INFO L130 PetriNetUnfolder]: 570/1070 cut-off events. [2022-12-06 00:29:03,239 INFO L131 PetriNetUnfolder]: For 6868/6868 co-relation queries the response was YES. [2022-12-06 00:29:03,242 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 00:29:03,246 INFO L137 encePairwiseOnDemand]: 13/35 looper letters, 92 selfloop transitions, 37 changer transitions 8/137 dead transitions. [2022-12-06 00:29:03,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 137 transitions, 1659 flow [2022-12-06 00:29:03,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-12-06 00:29:03,247 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29523809523809524 [2022-12-06 00:29:03,247 INFO L175 Difference]: Start difference. First operand has 81 places, 112 transitions, 1210 flow. Second operand 6 states and 62 transitions. [2022-12-06 00:29:03,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 137 transitions, 1659 flow [2022-12-06 00:29:03,260 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 00:29:03,265 INFO L231 Difference]: Finished difference. Result has 87 places, 116 transitions, 1342 flow [2022-12-06 00:29:03,265 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 00:29:03,265 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-06 00:29:03,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:03,265 INFO L89 Accepts]: Start accepts. Operand has 87 places, 116 transitions, 1342 flow [2022-12-06 00:29:03,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:03,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:03,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 116 transitions, 1342 flow [2022-12-06 00:29:03,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 116 transitions, 1342 flow [2022-12-06 00:29:03,294 INFO L130 PetriNetUnfolder]: 80/328 cut-off events. [2022-12-06 00:29:03,294 INFO L131 PetriNetUnfolder]: For 1485/1489 co-relation queries the response was YES. [2022-12-06 00:29:03,295 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 00:29:03,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 116 transitions, 1342 flow [2022-12-06 00:29:03,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 412 [2022-12-06 00:29:03,298 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 00:29:03,481 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:03,482 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 217 [2022-12-06 00:29:03,482 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 116 transitions, 1351 flow [2022-12-06 00:29:03,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:03,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:03,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 00:29:03,482 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash 609530576, now seen corresponding path program 1 times [2022-12-06 00:29:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:03,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28339753] [2022-12-06 00:29:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:03,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:03,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:03,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28339753] [2022-12-06 00:29:03,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28339753] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:03,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144859889] [2022-12-06 00:29:03,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:03,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:03,560 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:03,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 00:29:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:03,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:29:03,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:03,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:03,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144859889] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:03,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:03,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 00:29:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324416894] [2022-12-06 00:29:03,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:29:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:29:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:29:03,732 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:29:03,733 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 00:29:03,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:03,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:29:03,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:05,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:29:06,263 INFO L130 PetriNetUnfolder]: 553/1055 cut-off events. [2022-12-06 00:29:06,263 INFO L131 PetriNetUnfolder]: For 5972/5972 co-relation queries the response was YES. [2022-12-06 00:29:06,268 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 00:29:06,272 INFO L137 encePairwiseOnDemand]: 14/36 looper letters, 84 selfloop transitions, 65 changer transitions 16/165 dead transitions. [2022-12-06 00:29:06,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 2071 flow [2022-12-06 00:29:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:29:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:29:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 88 transitions. [2022-12-06 00:29:06,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-06 00:29:06,273 INFO L175 Difference]: Start difference. First operand has 87 places, 116 transitions, 1351 flow. Second operand 12 states and 88 transitions. [2022-12-06 00:29:06,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 165 transitions, 2071 flow [2022-12-06 00:29:06,286 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 00:29:06,289 INFO L231 Difference]: Finished difference. Result has 101 places, 123 transitions, 1582 flow [2022-12-06 00:29:06,289 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 00:29:06,289 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 00:29:06,290 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:06,290 INFO L89 Accepts]: Start accepts. Operand has 101 places, 123 transitions, 1582 flow [2022-12-06 00:29:06,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:06,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:06,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 123 transitions, 1582 flow [2022-12-06 00:29:06,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 123 transitions, 1582 flow [2022-12-06 00:29:06,318 INFO L130 PetriNetUnfolder]: 74/317 cut-off events. [2022-12-06 00:29:06,318 INFO L131 PetriNetUnfolder]: For 2026/2030 co-relation queries the response was YES. [2022-12-06 00:29:06,319 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 00:29:06,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 123 transitions, 1582 flow [2022-12-06 00:29:06,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 00:29:06,324 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 00:29:06,955 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 00:29:07,081 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 00:29:07,182 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 00:29:07,282 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 00:29:07,373 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 00:29:07,463 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 00:29:07,549 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:07,550 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1260 [2022-12-06 00:29:07,550 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 1624 flow [2022-12-06 00:29:07,550 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 00:29:07,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:07,550 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:07,559 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 00:29:07,755 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 00:29:07,756 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -370844362, now seen corresponding path program 1 times [2022-12-06 00:29:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:07,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058704127] [2022-12-06 00:29:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:08,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058704127] [2022-12-06 00:29:08,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058704127] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:08,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176253071] [2022-12-06 00:29:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:08,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:08,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:08,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:08,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 00:29:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:08,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 00:29:08,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:09,027 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 00:29:09,080 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:09,080 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 00:29:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:09,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:09,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:09,190 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 00:29:09,246 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:09,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-06 00:29:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176253071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:10,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:10,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 00:29:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115570871] [2022-12-06 00:29:10,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:10,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:29:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:29:10,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:29:10,391 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:29:10,391 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 00:29:10,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:10,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:29:10,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:11,171 INFO L130 PetriNetUnfolder]: 577/1104 cut-off events. [2022-12-06 00:29:11,171 INFO L131 PetriNetUnfolder]: For 8148/8148 co-relation queries the response was YES. [2022-12-06 00:29:11,174 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 00:29:11,179 INFO L137 encePairwiseOnDemand]: 15/41 looper letters, 113 selfloop transitions, 55 changer transitions 4/172 dead transitions. [2022-12-06 00:29:11,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 172 transitions, 2323 flow [2022-12-06 00:29:11,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:29:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:29:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 94 transitions. [2022-12-06 00:29:11,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.20842572062084258 [2022-12-06 00:29:11,180 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 1624 flow. Second operand 11 states and 94 transitions. [2022-12-06 00:29:11,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 172 transitions, 2323 flow [2022-12-06 00:29:11,196 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 00:29:11,198 INFO L231 Difference]: Finished difference. Result has 110 places, 131 transitions, 1796 flow [2022-12-06 00:29:11,198 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 00:29:11,199 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 00:29:11,199 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:11,199 INFO L89 Accepts]: Start accepts. Operand has 110 places, 131 transitions, 1796 flow [2022-12-06 00:29:11,200 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:11,200 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:11,200 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 131 transitions, 1796 flow [2022-12-06 00:29:11,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 131 transitions, 1796 flow [2022-12-06 00:29:11,230 INFO L130 PetriNetUnfolder]: 79/335 cut-off events. [2022-12-06 00:29:11,230 INFO L131 PetriNetUnfolder]: For 2368/2372 co-relation queries the response was YES. [2022-12-06 00:29:11,231 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 00:29:11,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 131 transitions, 1796 flow [2022-12-06 00:29:11,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 00:29:11,233 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:11,235 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 00:29:11,235 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 131 transitions, 1796 flow [2022-12-06 00:29:11,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:11,235 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:11,235 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:11,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:11,440 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 00:29:11,440 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1667431495, now seen corresponding path program 1 times [2022-12-06 00:29:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:11,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765959240] [2022-12-06 00:29:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:11,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:11,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765959240] [2022-12-06 00:29:11,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765959240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:11,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:11,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:29:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321265870] [2022-12-06 00:29:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:11,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:29:11,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:29:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:29:11,483 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:29:11,483 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 00:29:11,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:11,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:29:11,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:11,695 INFO L130 PetriNetUnfolder]: 558/1051 cut-off events. [2022-12-06 00:29:11,695 INFO L131 PetriNetUnfolder]: For 9622/9622 co-relation queries the response was YES. [2022-12-06 00:29:11,699 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 00:29:11,704 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 157 selfloop transitions, 8 changer transitions 5/170 dead transitions. [2022-12-06 00:29:11,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 170 transitions, 2609 flow [2022-12-06 00:29:11,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:29:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:29:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-06 00:29:11,705 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3983739837398374 [2022-12-06 00:29:11,705 INFO L175 Difference]: Start difference. First operand has 109 places, 131 transitions, 1796 flow. Second operand 3 states and 49 transitions. [2022-12-06 00:29:11,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 170 transitions, 2609 flow [2022-12-06 00:29:11,728 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 00:29:11,730 INFO L231 Difference]: Finished difference. Result has 105 places, 127 transitions, 1609 flow [2022-12-06 00:29:11,730 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 00:29:11,730 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 00:29:11,730 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:11,730 INFO L89 Accepts]: Start accepts. Operand has 105 places, 127 transitions, 1609 flow [2022-12-06 00:29:11,731 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:11,731 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:11,731 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 127 transitions, 1609 flow [2022-12-06 00:29:11,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 127 transitions, 1609 flow [2022-12-06 00:29:11,766 INFO L130 PetriNetUnfolder]: 78/320 cut-off events. [2022-12-06 00:29:11,766 INFO L131 PetriNetUnfolder]: For 1973/1977 co-relation queries the response was YES. [2022-12-06 00:29:11,768 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 00:29:11,770 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 127 transitions, 1609 flow [2022-12-06 00:29:11,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 00:29:11,802 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 00:29:12,735 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 00:29:13,076 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 00:29:13,568 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:13,569 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1839 [2022-12-06 00:29:13,569 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1658 flow [2022-12-06 00:29:13,569 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 00:29:13,569 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:13,569 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:13,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 00:29:13,570 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 825073917, now seen corresponding path program 2 times [2022-12-06 00:29:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:13,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205070407] [2022-12-06 00:29:13,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:13,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205070407] [2022-12-06 00:29:13,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205070407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:13,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:13,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:13,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549374676] [2022-12-06 00:29:13,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:13,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:13,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 00:29:13,658 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 00:29:13,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:13,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 00:29:13,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:14,020 INFO L130 PetriNetUnfolder]: 550/1082 cut-off events. [2022-12-06 00:29:14,020 INFO L131 PetriNetUnfolder]: For 8885/8885 co-relation queries the response was YES. [2022-12-06 00:29:14,023 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 00:29:14,036 INFO L137 encePairwiseOnDemand]: 19/41 looper letters, 155 selfloop transitions, 32 changer transitions 12/199 dead transitions. [2022-12-06 00:29:14,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 199 transitions, 2734 flow [2022-12-06 00:29:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:14,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 85 transitions. [2022-12-06 00:29:14,038 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23035230352303523 [2022-12-06 00:29:14,038 INFO L175 Difference]: Start difference. First operand has 105 places, 127 transitions, 1658 flow. Second operand 9 states and 85 transitions. [2022-12-06 00:29:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 199 transitions, 2734 flow [2022-12-06 00:29:14,061 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 00:29:14,065 INFO L231 Difference]: Finished difference. Result has 112 places, 127 transitions, 1680 flow [2022-12-06 00:29:14,065 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 00:29:14,066 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 91 predicate places. [2022-12-06 00:29:14,066 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:14,066 INFO L89 Accepts]: Start accepts. Operand has 112 places, 127 transitions, 1680 flow [2022-12-06 00:29:14,067 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:14,067 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:14,067 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 127 transitions, 1680 flow [2022-12-06 00:29:14,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 127 transitions, 1680 flow [2022-12-06 00:29:14,100 INFO L130 PetriNetUnfolder]: 80/329 cut-off events. [2022-12-06 00:29:14,100 INFO L131 PetriNetUnfolder]: For 2232/2236 co-relation queries the response was YES. [2022-12-06 00:29:14,103 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 00:29:14,114 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 127 transitions, 1680 flow [2022-12-06 00:29:14,114 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 00:29:14,488 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 00:29:14,931 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:14,932 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 866 [2022-12-06 00:29:14,932 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 1702 flow [2022-12-06 00:29:14,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:14,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:14,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:14,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 00:29:14,933 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:14,933 INFO L85 PathProgramCache]: Analyzing trace with hash 145999250, now seen corresponding path program 1 times [2022-12-06 00:29:14,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:14,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414994762] [2022-12-06 00:29:14,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:14,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:15,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414994762] [2022-12-06 00:29:15,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414994762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:15,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:15,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 00:29:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139998891] [2022-12-06 00:29:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:15,475 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:29:15,475 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 00:29:15,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:15,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:29:15,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:15,737 INFO L130 PetriNetUnfolder]: 545/1040 cut-off events. [2022-12-06 00:29:15,737 INFO L131 PetriNetUnfolder]: For 9018/9018 co-relation queries the response was YES. [2022-12-06 00:29:15,740 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 00:29:15,743 INFO L137 encePairwiseOnDemand]: 18/40 looper letters, 102 selfloop transitions, 32 changer transitions 8/142 dead transitions. [2022-12-06 00:29:15,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 142 transitions, 2097 flow [2022-12-06 00:29:15,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-06 00:29:15,744 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34375 [2022-12-06 00:29:15,744 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 1702 flow. Second operand 4 states and 55 transitions. [2022-12-06 00:29:15,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 142 transitions, 2097 flow [2022-12-06 00:29:15,764 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 00:29:15,766 INFO L231 Difference]: Finished difference. Result has 105 places, 126 transitions, 1685 flow [2022-12-06 00:29:15,766 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 00:29:15,767 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 00:29:15,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:15,767 INFO L89 Accepts]: Start accepts. Operand has 105 places, 126 transitions, 1685 flow [2022-12-06 00:29:15,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:15,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:15,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 126 transitions, 1685 flow [2022-12-06 00:29:15,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 126 transitions, 1685 flow [2022-12-06 00:29:15,795 INFO L130 PetriNetUnfolder]: 79/326 cut-off events. [2022-12-06 00:29:15,796 INFO L131 PetriNetUnfolder]: For 2051/2055 co-relation queries the response was YES. [2022-12-06 00:29:15,797 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 00:29:15,798 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 126 transitions, 1685 flow [2022-12-06 00:29:15,798 INFO L188 LiptonReduction]: Number of co-enabled transitions 408 [2022-12-06 00:29:16,987 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 00:29:17,022 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 00:29:17,539 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 00:29:18,383 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:29:18,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2616 [2022-12-06 00:29:18,383 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 126 transitions, 1762 flow [2022-12-06 00:29:18,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:18,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:18,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 00:29:18,384 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1882138312, now seen corresponding path program 1 times [2022-12-06 00:29:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131439817] [2022-12-06 00:29:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:18,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:18,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131439817] [2022-12-06 00:29:18,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131439817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:18,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:18,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28695373] [2022-12-06 00:29:18,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:18,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:18,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:18,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:18,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-06 00:29:18,454 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 00:29:18,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:18,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-06 00:29:18,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:18,694 INFO L130 PetriNetUnfolder]: 509/945 cut-off events. [2022-12-06 00:29:18,694 INFO L131 PetriNetUnfolder]: For 7455/7455 co-relation queries the response was YES. [2022-12-06 00:29:18,697 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 00:29:18,700 INFO L137 encePairwiseOnDemand]: 26/45 looper letters, 95 selfloop transitions, 27 changer transitions 17/139 dead transitions. [2022-12-06 00:29:18,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 139 transitions, 2196 flow [2022-12-06 00:29:18,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:18,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 00:29:18,702 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3111111111111111 [2022-12-06 00:29:18,702 INFO L175 Difference]: Start difference. First operand has 103 places, 126 transitions, 1762 flow. Second operand 4 states and 56 transitions. [2022-12-06 00:29:18,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 139 transitions, 2196 flow [2022-12-06 00:29:18,717 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 00:29:18,718 INFO L231 Difference]: Finished difference. Result has 103 places, 115 transitions, 1591 flow [2022-12-06 00:29:18,719 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 00:29:18,719 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 00:29:18,719 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:18,719 INFO L89 Accepts]: Start accepts. Operand has 103 places, 115 transitions, 1591 flow [2022-12-06 00:29:18,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:18,720 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:18,720 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 115 transitions, 1591 flow [2022-12-06 00:29:18,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 115 transitions, 1591 flow [2022-12-06 00:29:18,745 INFO L130 PetriNetUnfolder]: 76/273 cut-off events. [2022-12-06 00:29:18,745 INFO L131 PetriNetUnfolder]: For 2002/2006 co-relation queries the response was YES. [2022-12-06 00:29:18,746 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 00:29:18,747 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 115 transitions, 1591 flow [2022-12-06 00:29:18,747 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-06 00:29:18,748 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:18,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 00:29:18,749 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 115 transitions, 1591 flow [2022-12-06 00:29:18,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:18,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:18,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:18,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 00:29:18,750 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash -845534643, now seen corresponding path program 1 times [2022-12-06 00:29:18,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:18,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430105107] [2022-12-06 00:29:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:18,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430105107] [2022-12-06 00:29:18,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430105107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:18,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:18,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:18,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026884624] [2022-12-06 00:29:18,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:18,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:18,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:18,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:18,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:18,819 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:29:18,819 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 00:29:18,819 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:18,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:29:18,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:19,109 INFO L130 PetriNetUnfolder]: 487/891 cut-off events. [2022-12-06 00:29:19,109 INFO L131 PetriNetUnfolder]: For 7030/7030 co-relation queries the response was YES. [2022-12-06 00:29:19,112 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 00:29:19,114 INFO L137 encePairwiseOnDemand]: 21/39 looper letters, 95 selfloop transitions, 38 changer transitions 3/136 dead transitions. [2022-12-06 00:29:19,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 136 transitions, 2085 flow [2022-12-06 00:29:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-06 00:29:19,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2606837606837607 [2022-12-06 00:29:19,115 INFO L175 Difference]: Start difference. First operand has 97 places, 115 transitions, 1591 flow. Second operand 6 states and 61 transitions. [2022-12-06 00:29:19,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 136 transitions, 2085 flow [2022-12-06 00:29:19,130 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 00:29:19,132 INFO L231 Difference]: Finished difference. Result has 102 places, 118 transitions, 1698 flow [2022-12-06 00:29:19,132 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 00:29:19,132 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 81 predicate places. [2022-12-06 00:29:19,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:19,133 INFO L89 Accepts]: Start accepts. Operand has 102 places, 118 transitions, 1698 flow [2022-12-06 00:29:19,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:19,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:19,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 118 transitions, 1698 flow [2022-12-06 00:29:19,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 118 transitions, 1698 flow [2022-12-06 00:29:19,159 INFO L130 PetriNetUnfolder]: 78/275 cut-off events. [2022-12-06 00:29:19,159 INFO L131 PetriNetUnfolder]: For 2352/2356 co-relation queries the response was YES. [2022-12-06 00:29:19,160 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 00:29:19,161 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 118 transitions, 1698 flow [2022-12-06 00:29:19,161 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 00:29:19,161 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:19,162 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 00:29:19,162 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 1698 flow [2022-12-06 00:29:19,162 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 00:29:19,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:19,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:19,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 00:29:19,162 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash -180227545, now seen corresponding path program 1 times [2022-12-06 00:29:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:19,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054440691] [2022-12-06 00:29:19,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054440691] [2022-12-06 00:29:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054440691] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668590291] [2022-12-06 00:29:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:19,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:19,234 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:19,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 00:29:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:19,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 59 conjunts are in the unsatisfiable core [2022-12-06 00:29:19,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:19,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:19,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:29:19,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:19,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:19,365 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 00:29:19,685 INFO L321 Elim1Store]: treesize reduction 259, result has 10.4 percent of original size [2022-12-06 00:29:19,685 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 00:29:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:19,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:20,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668590291] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:20,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:20,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 00:29:20,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234818844] [2022-12-06 00:29:20,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:20,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:29:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:29:20,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-06 00:29:20,447 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:29:20,448 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 00:29:20,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:20,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:29:20,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:23,460 INFO L130 PetriNetUnfolder]: 545/1004 cut-off events. [2022-12-06 00:29:23,460 INFO L131 PetriNetUnfolder]: For 9715/9715 co-relation queries the response was YES. [2022-12-06 00:29:23,462 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 00:29:23,464 INFO L137 encePairwiseOnDemand]: 12/39 looper letters, 93 selfloop transitions, 47 changer transitions 40/180 dead transitions. [2022-12-06 00:29:23,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 180 transitions, 2674 flow [2022-12-06 00:29:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:29:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:29:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 109 transitions. [2022-12-06 00:29:23,465 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17467948717948717 [2022-12-06 00:29:23,465 INFO L175 Difference]: Start difference. First operand has 102 places, 118 transitions, 1698 flow. Second operand 16 states and 109 transitions. [2022-12-06 00:29:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 180 transitions, 2674 flow [2022-12-06 00:29:23,481 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 00:29:23,484 INFO L231 Difference]: Finished difference. Result has 121 places, 115 transitions, 1690 flow [2022-12-06 00:29:23,484 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 00:29:23,484 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 00:29:23,484 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:23,484 INFO L89 Accepts]: Start accepts. Operand has 121 places, 115 transitions, 1690 flow [2022-12-06 00:29:23,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:23,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:23,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 115 transitions, 1690 flow [2022-12-06 00:29:23,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 1690 flow [2022-12-06 00:29:23,512 INFO L130 PetriNetUnfolder]: 70/268 cut-off events. [2022-12-06 00:29:23,512 INFO L131 PetriNetUnfolder]: For 2447/2451 co-relation queries the response was YES. [2022-12-06 00:29:23,513 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 1488 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 00:29:23,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 1690 flow [2022-12-06 00:29:23,514 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 00:29:23,533 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 00:29:24,138 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 00:29:29,052 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:29,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5569 [2022-12-06 00:29:29,053 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 1767 flow [2022-12-06 00:29:29,053 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 00:29:29,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:29,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:29,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:29,257 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 00:29:29,258 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:29,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash -358287517, now seen corresponding path program 1 times [2022-12-06 00:29:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:29,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653352627] [2022-12-06 00:29:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:29,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653352627] [2022-12-06 00:29:29,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653352627] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:29,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:29,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:29,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718544034] [2022-12-06 00:29:29,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:29,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:29,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:29,321 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-06 00:29:29,321 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 00:29:29,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:29,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-06 00:29:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:29,655 INFO L130 PetriNetUnfolder]: 487/921 cut-off events. [2022-12-06 00:29:29,656 INFO L131 PetriNetUnfolder]: For 10906/10906 co-relation queries the response was YES. [2022-12-06 00:29:29,658 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 4541 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 00:29:29,661 INFO L137 encePairwiseOnDemand]: 17/39 looper letters, 129 selfloop transitions, 47 changer transitions 4/180 dead transitions. [2022-12-06 00:29:29,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 180 transitions, 2932 flow [2022-12-06 00:29:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:29:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:29:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2022-12-06 00:29:29,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21082621082621084 [2022-12-06 00:29:29,662 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 1767 flow. Second operand 9 states and 74 transitions. [2022-12-06 00:29:29,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 180 transitions, 2932 flow [2022-12-06 00:29:29,679 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 00:29:29,681 INFO L231 Difference]: Finished difference. Result has 116 places, 129 transitions, 1785 flow [2022-12-06 00:29:29,681 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 00:29:29,685 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 95 predicate places. [2022-12-06 00:29:29,685 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:29,685 INFO L89 Accepts]: Start accepts. Operand has 116 places, 129 transitions, 1785 flow [2022-12-06 00:29:29,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:29,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:29,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 129 transitions, 1785 flow [2022-12-06 00:29:29,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 129 transitions, 1785 flow [2022-12-06 00:29:29,715 INFO L130 PetriNetUnfolder]: 78/292 cut-off events. [2022-12-06 00:29:29,715 INFO L131 PetriNetUnfolder]: For 2436/2440 co-relation queries the response was YES. [2022-12-06 00:29:29,716 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 1643 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 00:29:29,718 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 129 transitions, 1785 flow [2022-12-06 00:29:29,718 INFO L188 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-06 00:29:29,722 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 00:29:29,817 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 00:29:29,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:29,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 238 [2022-12-06 00:29:29,923 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 128 transitions, 1793 flow [2022-12-06 00:29:29,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:29,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:29,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:29,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 00:29:29,924 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1517225268, now seen corresponding path program 1 times [2022-12-06 00:29:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:29,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709147390] [2022-12-06 00:29:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:29,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:29,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709147390] [2022-12-06 00:29:29,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709147390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:29,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293259188] [2022-12-06 00:29:29,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:29,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:29,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:29,996 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:29,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 00:29:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:30,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:29:30,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:30,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:30,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293259188] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:30,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:30,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 00:29:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302198250] [2022-12-06 00:29:30,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:30,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:29:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:30,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:29:30,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:29:30,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 00:29:30,286 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 00:29:30,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:30,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 00:29:30,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:30,605 INFO L130 PetriNetUnfolder]: 497/936 cut-off events. [2022-12-06 00:29:30,605 INFO L131 PetriNetUnfolder]: For 8570/8570 co-relation queries the response was YES. [2022-12-06 00:29:30,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6126 conditions, 936 events. 497/936 cut-off events. For 8570/8570 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4531 event pairs, 216 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 00:29:30,611 INFO L137 encePairwiseOnDemand]: 26/40 looper letters, 99 selfloop transitions, 17 changer transitions 33/149 dead transitions. [2022-12-06 00:29:30,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 149 transitions, 2365 flow [2022-12-06 00:29:30,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:29:30,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:29:30,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-06 00:29:30,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22142857142857142 [2022-12-06 00:29:30,612 INFO L175 Difference]: Start difference. First operand has 114 places, 128 transitions, 1793 flow. Second operand 7 states and 62 transitions. [2022-12-06 00:29:30,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 149 transitions, 2365 flow [2022-12-06 00:29:30,633 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 00:29:30,636 INFO L231 Difference]: Finished difference. Result has 121 places, 109 transitions, 1494 flow [2022-12-06 00:29:30,636 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 00:29:30,637 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 100 predicate places. [2022-12-06 00:29:30,637 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:30,637 INFO L89 Accepts]: Start accepts. Operand has 121 places, 109 transitions, 1494 flow [2022-12-06 00:29:30,638 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:30,638 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:30,638 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 109 transitions, 1494 flow [2022-12-06 00:29:30,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 109 transitions, 1494 flow [2022-12-06 00:29:30,676 INFO L130 PetriNetUnfolder]: 65/273 cut-off events. [2022-12-06 00:29:30,676 INFO L131 PetriNetUnfolder]: For 2389/2393 co-relation queries the response was YES. [2022-12-06 00:29:30,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 273 events. 65/273 cut-off events. For 2389/2393 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1563 event pairs, 1 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 1517. Up to 77 conditions per place. [2022-12-06 00:29:30,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 109 transitions, 1494 flow [2022-12-06 00:29:30,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 00:29:30,704 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 00:29:31,162 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:31,163 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 526 [2022-12-06 00:29:31,163 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 1512 flow [2022-12-06 00:29:31,163 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 00:29:31,163 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:31,163 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:31,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:31,367 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 00:29:31,367 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:31,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:31,368 INFO L85 PathProgramCache]: Analyzing trace with hash -595237370, now seen corresponding path program 1 times [2022-12-06 00:29:31,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:31,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269713655] [2022-12-06 00:29:31,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:31,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:31,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:31,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269713655] [2022-12-06 00:29:31,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269713655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:31,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:31,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:31,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348572655] [2022-12-06 00:29:31,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:31,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:31,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 00:29:31,430 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.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 00:29:31,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:31,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 00:29:31,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:31,639 INFO L130 PetriNetUnfolder]: 448/861 cut-off events. [2022-12-06 00:29:31,639 INFO L131 PetriNetUnfolder]: For 8574/8574 co-relation queries the response was YES. [2022-12-06 00:29:31,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 861 events. 448/861 cut-off events. For 8574/8574 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4139 event pairs, 230 based on Foata normal form. 12/873 useless extension candidates. Maximal degree in co-relation 5363. Up to 787 conditions per place. [2022-12-06 00:29:31,644 INFO L137 encePairwiseOnDemand]: 22/35 looper letters, 91 selfloop transitions, 17 changer transitions 11/119 dead transitions. [2022-12-06 00:29:31,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 1832 flow [2022-12-06 00:29:31,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 00:29:31,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2742857142857143 [2022-12-06 00:29:31,645 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 1512 flow. Second operand 5 states and 48 transitions. [2022-12-06 00:29:31,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 1832 flow [2022-12-06 00:29:31,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1750 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-06 00:29:31,661 INFO L231 Difference]: Finished difference. Result has 114 places, 102 transitions, 1407 flow [2022-12-06 00:29:31,661 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=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1407, PETRI_PLACES=114, PETRI_TRANSITIONS=102} [2022-12-06 00:29:31,661 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 00:29:31,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:31,661 INFO L89 Accepts]: Start accepts. Operand has 114 places, 102 transitions, 1407 flow [2022-12-06 00:29:31,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:31,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:31,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 102 transitions, 1407 flow [2022-12-06 00:29:31,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 1407 flow [2022-12-06 00:29:31,685 INFO L130 PetriNetUnfolder]: 61/260 cut-off events. [2022-12-06 00:29:31,685 INFO L131 PetriNetUnfolder]: For 2196/2200 co-relation queries the response was YES. [2022-12-06 00:29:31,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 260 events. 61/260 cut-off events. For 2196/2200 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1462 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 1413. Up to 77 conditions per place. [2022-12-06 00:29:31,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 1407 flow [2022-12-06 00:29:31,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 00:29:31,688 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:31,688 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 00:29:31,688 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 1407 flow [2022-12-06 00:29:31,688 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 00:29:31,688 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:31,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:31,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 00:29:31,689 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash -589499500, now seen corresponding path program 1 times [2022-12-06 00:29:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:31,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840341478] [2022-12-06 00:29:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:31,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:31,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840341478] [2022-12-06 00:29:31,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840341478] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:31,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:31,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:31,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434628129] [2022-12-06 00:29:31,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:31,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:31,770 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:29:31,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 1407 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:31,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:31,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:29:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:32,000 INFO L130 PetriNetUnfolder]: 437/868 cut-off events. [2022-12-06 00:29:32,000 INFO L131 PetriNetUnfolder]: For 7929/7929 co-relation queries the response was YES. [2022-12-06 00:29:32,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5433 conditions, 868 events. 437/868 cut-off events. For 7929/7929 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4396 event pairs, 90 based on Foata normal form. 4/872 useless extension candidates. Maximal degree in co-relation 5319. Up to 434 conditions per place. [2022-12-06 00:29:32,005 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 128 selfloop transitions, 26 changer transitions 3/157 dead transitions. [2022-12-06 00:29:32,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 157 transitions, 2355 flow [2022-12-06 00:29:32,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-12-06 00:29:32,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2828282828282828 [2022-12-06 00:29:32,006 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 1407 flow. Second operand 6 states and 56 transitions. [2022-12-06 00:29:32,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 157 transitions, 2355 flow [2022-12-06 00:29:32,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 157 transitions, 2272 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-06 00:29:32,022 INFO L231 Difference]: Finished difference. Result has 110 places, 105 transitions, 1465 flow [2022-12-06 00:29:32,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1465, PETRI_PLACES=110, PETRI_TRANSITIONS=105} [2022-12-06 00:29:32,022 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2022-12-06 00:29:32,023 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:32,023 INFO L89 Accepts]: Start accepts. Operand has 110 places, 105 transitions, 1465 flow [2022-12-06 00:29:32,023 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:32,023 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:32,023 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 1465 flow [2022-12-06 00:29:32,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 1465 flow [2022-12-06 00:29:32,049 INFO L130 PetriNetUnfolder]: 63/286 cut-off events. [2022-12-06 00:29:32,049 INFO L131 PetriNetUnfolder]: For 2493/2497 co-relation queries the response was YES. [2022-12-06 00:29:32,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 286 events. 63/286 cut-off events. For 2493/2497 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1669 event pairs, 1 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 1518. Up to 83 conditions per place. [2022-12-06 00:29:32,052 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 1465 flow [2022-12-06 00:29:32,052 INFO L188 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-06 00:29:32,052 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:32,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 00:29:32,053 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 1465 flow [2022-12-06 00:29:32,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:32,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:32,053 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:32,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 00:29:32,053 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:32,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash -2015994296, now seen corresponding path program 2 times [2022-12-06 00:29:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:32,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584180356] [2022-12-06 00:29:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:32,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:32,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:32,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584180356] [2022-12-06 00:29:32,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584180356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:32,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:32,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380823962] [2022-12-06 00:29:32,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:32,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:32,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:29:32,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 1465 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:32,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:32,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:29:32,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:32,378 INFO L130 PetriNetUnfolder]: 422/836 cut-off events. [2022-12-06 00:29:32,378 INFO L131 PetriNetUnfolder]: For 8208/8208 co-relation queries the response was YES. [2022-12-06 00:29:32,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 836 events. 422/836 cut-off events. For 8208/8208 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4070 event pairs, 212 based on Foata normal form. 8/844 useless extension candidates. Maximal degree in co-relation 4949. Up to 749 conditions per place. [2022-12-06 00:29:32,382 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 89 selfloop transitions, 17 changer transitions 13/119 dead transitions. [2022-12-06 00:29:32,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 119 transitions, 1819 flow [2022-12-06 00:29:32,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:32,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-06 00:29:32,383 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2727272727272727 [2022-12-06 00:29:32,383 INFO L175 Difference]: Start difference. First operand has 110 places, 105 transitions, 1465 flow. Second operand 6 states and 54 transitions. [2022-12-06 00:29:32,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 119 transitions, 1819 flow [2022-12-06 00:29:32,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 119 transitions, 1793 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 00:29:32,399 INFO L231 Difference]: Finished difference. Result has 115 places, 98 transitions, 1377 flow [2022-12-06 00:29:32,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1377, PETRI_PLACES=115, PETRI_TRANSITIONS=98} [2022-12-06 00:29:32,399 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2022-12-06 00:29:32,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:32,400 INFO L89 Accepts]: Start accepts. Operand has 115 places, 98 transitions, 1377 flow [2022-12-06 00:29:32,400 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:32,400 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:32,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 98 transitions, 1377 flow [2022-12-06 00:29:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 98 transitions, 1377 flow [2022-12-06 00:29:32,430 INFO L130 PetriNetUnfolder]: 60/259 cut-off events. [2022-12-06 00:29:32,430 INFO L131 PetriNetUnfolder]: For 2275/2279 co-relation queries the response was YES. [2022-12-06 00:29:32,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 259 events. 60/259 cut-off events. For 2275/2279 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1434 event pairs, 1 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 1432. Up to 81 conditions per place. [2022-12-06 00:29:32,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 98 transitions, 1377 flow [2022-12-06 00:29:32,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 306 [2022-12-06 00:29:32,636 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 00:29:33,183 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:29:33,184 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 784 [2022-12-06 00:29:33,184 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 95 transitions, 1351 flow [2022-12-06 00:29:33,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:33,184 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:33,184 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:33,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 00:29:33,185 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:33,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1663344253, now seen corresponding path program 1 times [2022-12-06 00:29:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:33,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529002307] [2022-12-06 00:29:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:33,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529002307] [2022-12-06 00:29:33,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529002307] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:33,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:33,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 00:29:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822624157] [2022-12-06 00:29:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 00:29:33,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:33,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 00:29:33,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 00:29:33,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:29:33,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 95 transitions, 1351 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:33,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:33,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:29:33,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:33,384 INFO L130 PetriNetUnfolder]: 381/732 cut-off events. [2022-12-06 00:29:33,384 INFO L131 PetriNetUnfolder]: For 6891/6891 co-relation queries the response was YES. [2022-12-06 00:29:33,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4805 conditions, 732 events. 381/732 cut-off events. For 6891/6891 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3285 event pairs, 184 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 4679. Up to 650 conditions per place. [2022-12-06 00:29:33,389 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 83 selfloop transitions, 16 changer transitions 1/100 dead transitions. [2022-12-06 00:29:33,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 100 transitions, 1582 flow [2022-12-06 00:29:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 00:29:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 00:29:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-12-06 00:29:33,391 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3275862068965517 [2022-12-06 00:29:33,392 INFO L175 Difference]: Start difference. First operand has 109 places, 95 transitions, 1351 flow. Second operand 4 states and 38 transitions. [2022-12-06 00:29:33,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 100 transitions, 1582 flow [2022-12-06 00:29:33,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 1398 flow, removed 20 selfloop flow, removed 15 redundant places. [2022-12-06 00:29:33,407 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 1154 flow [2022-12-06 00:29:33,408 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1154, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2022-12-06 00:29:33,408 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 00:29:33,408 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:33,408 INFO L89 Accepts]: Start accepts. Operand has 98 places, 93 transitions, 1154 flow [2022-12-06 00:29:33,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:33,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:33,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 1154 flow [2022-12-06 00:29:33,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 1154 flow [2022-12-06 00:29:33,430 INFO L130 PetriNetUnfolder]: 59/241 cut-off events. [2022-12-06 00:29:33,430 INFO L131 PetriNetUnfolder]: For 1485/1489 co-relation queries the response was YES. [2022-12-06 00:29:33,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 241 events. 59/241 cut-off events. For 1485/1489 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1245 event pairs, 1 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 1099. Up to 79 conditions per place. [2022-12-06 00:29:33,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 1154 flow [2022-12-06 00:29:33,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 284 [2022-12-06 00:29:33,433 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:33,433 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 00:29:33,433 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 1154 flow [2022-12-06 00:29:33,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:33,433 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:33,434 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:33,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 00:29:33,434 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash -659656618, now seen corresponding path program 1 times [2022-12-06 00:29:33,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:33,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523536255] [2022-12-06 00:29:33,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:33,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:34,333 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 00:29:34,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523536255] [2022-12-06 00:29:34,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523536255] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:34,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525903526] [2022-12-06 00:29:34,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:34,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:34,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:34,335 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:34,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 00:29:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:34,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 00:29:34,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:34,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:34,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 00:29:34,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:34,520 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 00:29:34,528 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 00:29:34,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:34,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:34,666 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 00:29:34,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:29:34,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 140 [2022-12-06 00:29:35,665 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 00:29:35,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525903526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:35,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:35,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 00:29:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799224221] [2022-12-06 00:29:35,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:35,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:29:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:29:35,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:29:35,667 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:29:35,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 1154 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:35,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:35,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:29:35,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:36,765 INFO L130 PetriNetUnfolder]: 616/1167 cut-off events. [2022-12-06 00:29:36,765 INFO L131 PetriNetUnfolder]: For 8912/8912 co-relation queries the response was YES. [2022-12-06 00:29:36,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7327 conditions, 1167 events. 616/1167 cut-off events. For 8912/8912 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5943 event pairs, 81 based on Foata normal form. 4/1171 useless extension candidates. Maximal degree in co-relation 6221. Up to 638 conditions per place. [2022-12-06 00:29:36,771 INFO L137 encePairwiseOnDemand]: 10/27 looper letters, 99 selfloop transitions, 65 changer transitions 10/174 dead transitions. [2022-12-06 00:29:36,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 174 transitions, 2275 flow [2022-12-06 00:29:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:29:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:29:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2022-12-06 00:29:36,772 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2678062678062678 [2022-12-06 00:29:36,772 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 1154 flow. Second operand 13 states and 94 transitions. [2022-12-06 00:29:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 174 transitions, 2275 flow [2022-12-06 00:29:36,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 174 transitions, 2208 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 00:29:36,804 INFO L231 Difference]: Finished difference. Result has 111 places, 123 transitions, 1778 flow [2022-12-06 00:29:36,804 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1778, PETRI_PLACES=111, PETRI_TRANSITIONS=123} [2022-12-06 00:29:36,805 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 90 predicate places. [2022-12-06 00:29:36,805 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:36,805 INFO L89 Accepts]: Start accepts. Operand has 111 places, 123 transitions, 1778 flow [2022-12-06 00:29:36,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:36,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:36,806 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 123 transitions, 1778 flow [2022-12-06 00:29:36,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 123 transitions, 1778 flow [2022-12-06 00:29:36,837 INFO L130 PetriNetUnfolder]: 83/344 cut-off events. [2022-12-06 00:29:36,837 INFO L131 PetriNetUnfolder]: For 2292/2296 co-relation queries the response was YES. [2022-12-06 00:29:36,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 344 events. 83/344 cut-off events. For 2292/2296 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2075 event pairs, 1 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1780. Up to 131 conditions per place. [2022-12-06 00:29:36,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 123 transitions, 1778 flow [2022-12-06 00:29:36,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 00:29:36,860 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 00:29:37,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [713] $Ultimate##0-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_347| v_~f~0.base_231))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_227 (* v_~x2~0_276 4))))) (let ((.cse5 (select .cse0 (+ v_~f~0.offset_227 (* .cse4 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_227 (* .cse5 4))))) (let ((.cse2 (select .cse0 (+ v_~f~0.offset_227 (* .cse3 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_227 (* .cse2 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_172|) (< 3 (mod (* 3 v_~n~0_221) 4294967296)) (= (select .cse0 (+ v_~f~0.offset_227 (* .cse1 4))) v_~x2~0_274) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_186|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140| (ite (and (< .cse1 v_~size~0_231) (<= 0 .cse1)) 1 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_251| 1) (= (ite (and (< v_~x1~0_369 v_~size~0_231) (<= 0 v_~x1~0_369)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_172| 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_231)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_231)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_231)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_276 v_~size~0_231) (<= 0 v_~x2~0_276)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_231)) 1 0) 0)) (= v_~x1~0_368 (select .cse0 (+ v_~f~0.offset_227 (* v_~x1~0_369 4))))))))))) InVars {~x2~0=v_~x2~0_276, ~size~0=v_~size~0_231, ~f~0.base=v_~f~0.base_231, #memory_int=|v_#memory_int_347|, ~n~0=v_~n~0_221, ~x1~0=v_~x1~0_369, ~f~0.offset=v_~f~0.offset_227} OutVars{~x2~0=v_~x2~0_274, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_186|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_132|, ~size~0=v_~size~0_231, ~f~0.base=v_~f~0.base_231, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_104|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_140|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_186|, ~x1~0=v_~x1~0_368, ~f~0.offset=v_~f~0.offset_227, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_172|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_178|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_96|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_251|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_94|, #memory_int=|v_#memory_int_347|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_194|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_104|, ~n~0=v_~n~0_221, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_108|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_196|} 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 00:29:38,399 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_367| v_~f~0.base_251))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_247 (* v_~x2~0_325 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_247 (* .cse5 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_247 (* .cse3 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_247 (* .cse2 4))))) (let ((.cse1 (select .cse4 (+ (* .cse0 4) v_~f~0.offset_247)))) (and (not (= (ite (and (< .cse0 v_~size~0_251) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_251)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|) (not (= (ite (and (< .cse2 v_~size~0_251) (<= 0 .cse2)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (= (ite (and (< v_~x1~0_409 v_~size~0_251) (<= 0 v_~x1~0_409)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (not (= (ite (and (< .cse3 v_~size~0_251) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_216| 4294967293) 4294967296) (mod (* 3 v_~n~0_241) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_251) (<= 0 v_~x2~0_325)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_247 (* v_~x1~0_409 4))) v_~x1~0_408) (= v_~x2~0_324 (select .cse4 (+ v_~f~0.offset_247 (* .cse1 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_216|) (= |v_thread1Thread1of1ForFork0_~i~0#1_275| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_251)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, #memory_int=|v_#memory_int_367|, ~n~0=v_~n~0_241, ~x1~0=v_~x1~0_409, ~f~0.offset=v_~f~0.offset_247} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_162|, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_134|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_408, ~f~0.offset=v_~f~0.offset_247, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_126|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_275|, #memory_int=|v_#memory_int_367|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_124|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_134|, ~n~0=v_~n~0_241, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_138|} 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 00:29:39,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [754] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_410| v_~f~0.base_285))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_281 (* v_~x2~0_398 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_281 (* .cse2 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_398) (< v_~x2~0_398 v_~size~0_285)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216| (ite (and (< .cse0 v_~size~0_285) (<= 0 .cse0)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248| 0)) (= v_~x2~0_397 (select .cse1 (+ v_~f~0.offset_281 (* .cse0 4)))) (not (= (ite (and (< .cse2 v_~size~0_285) (<= 0 .cse2)) 1 0) 0)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_336| 1) |v_thread1Thread1of1ForFork0_~i~0#1_335|) (= v_~x1~0_486 (select .cse1 (+ v_~f~0.offset_281 (* v_~x1~0_487 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_263|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_336| 4294967296) (mod (* 3 v_~n~0_275) 4294967296)) (= (ite (and (<= 0 v_~x1~0_487) (< v_~x1~0_487 v_~size~0_285)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_263| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_274|))))) InVars {~x2~0=v_~x2~0_398, ~size~0=v_~size~0_285, ~f~0.base=v_~f~0.base_285, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_336|, #memory_int=|v_#memory_int_410|, ~n~0=v_~n~0_275, ~x1~0=v_~x1~0_487, ~f~0.offset=v_~f~0.offset_281} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_255|, ~x2~0=v_~x2~0_397, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_208|, ~size~0=v_~size~0_285, ~f~0.base=v_~f~0.base_285, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_180|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_216|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_274|, ~x1~0=v_~x1~0_486, ~f~0.offset=v_~f~0.offset_281, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_248|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_247|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_172|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_335|, #memory_int=|v_#memory_int_410|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_263|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_170|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_180|, ~n~0=v_~n~0_275, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_265|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_184|} 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 00:29:40,037 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_367| v_~f~0.base_251))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_247 (* v_~x2~0_325 4))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_247 (* .cse5 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_247 (* .cse3 4))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_247 (* .cse2 4))))) (let ((.cse1 (select .cse4 (+ (* .cse0 4) v_~f~0.offset_247)))) (and (not (= (ite (and (< .cse0 v_~size~0_251) (<= 0 .cse0)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_251)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|) (not (= (ite (and (< .cse2 v_~size~0_251) (<= 0 .cse2)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|) (= (ite (and (< v_~x1~0_409 v_~size~0_251) (<= 0 v_~x1~0_409)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|) (not (= (ite (and (< .cse3 v_~size~0_251) (<= 0 .cse3)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216| 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_216| 4294967293) 4294967296) (mod (* 3 v_~n~0_241) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202| 0)) (not (= (ite (and (< v_~x2~0_325 v_~size~0_251) (<= 0 v_~x2~0_325)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_247 (* v_~x1~0_409 4))) v_~x1~0_408) (= v_~x2~0_324 (select .cse4 (+ v_~f~0.offset_247 (* .cse1 4)))) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_216|) (= |v_thread1Thread1of1ForFork0_~i~0#1_275| 1) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_251)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_325, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, #memory_int=|v_#memory_int_367|, ~n~0=v_~n~0_241, ~x1~0=v_~x1~0_409, ~f~0.offset=v_~f~0.offset_247} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_208|, ~x2~0=v_~x2~0_324, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_162|, ~size~0=v_~size~0_251, ~f~0.base=v_~f~0.base_251, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_134|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_170|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_216|, ~x1~0=v_~x1~0_408, ~f~0.offset=v_~f~0.offset_247, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_202|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_200|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_126|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_275|, #memory_int=|v_#memory_int_367|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_216|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_124|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_134|, ~n~0=v_~n~0_241, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_218|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_138|} 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 [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] [2022-12-06 00:29:40,467 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_426| v_~f~0.base_301))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_297 (* v_~x2~0_438 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_297 (* .cse4 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_297 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_297 (* .cse6 4))))) (let ((.cse0 (mod (* 3 v_~n~0_291) 4294967296)) (.cse2 (select .cse1 (+ (* .cse5 4) v_~f~0.offset_297)))) (and (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_62|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_62| 0) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967293) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272| 0)) (= v_~x1~0_520 (select .cse1 (+ v_~f~0.offset_297 (* v_~x1~0_521 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| (ite (and (< .cse2 v_~size~0_301) (<= 0 .cse2)) 1 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_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| (ite (and (<= 0 v_~x1~0_521) (< v_~x1~0_521 v_~size~0_301)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_298|) (not (= 0 (ite (and (< .cse5 v_~size~0_301) (<= 0 .cse5)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_297 (* .cse2 4))) v_~x2~0_437) (= |v_thread1Thread1of1ForFork0_~i~0#1_361| 1) (not (= (ite (and (< v_~x2~0_438 v_~size~0_301) (<= 0 v_~x2~0_438)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|)))))))) InVars {~x2~0=v_~x2~0_438, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, #memory_int=|v_#memory_int_426|, ~n~0=v_~n~0_291, ~x1~0=v_~x1~0_521, ~f~0.offset=v_~f~0.offset_297} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_275|, ~x2~0=v_~x2~0_437, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_232|, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_62|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_298|, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_297, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_361|, #memory_int=|v_#memory_int_426|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_194|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_204|, ~n~0=v_~n~0_291, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_285|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_208|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, 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, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#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 00:29:40,957 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [768] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse1 (select |v_#memory_int_426| v_~f~0.base_301))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_297 (* v_~x2~0_438 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_297 (* .cse4 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_297 (* .cse3 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_297 (* .cse6 4))))) (let ((.cse0 (mod (* 3 v_~n~0_291) 4294967296)) (.cse2 (select .cse1 (+ (* .cse5 4) v_~f~0.offset_297)))) (and (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_62|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_62| 0) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967293) 4294967296) .cse0) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272| 0)) (= v_~x1~0_520 (select .cse1 (+ v_~f~0.offset_297 (* v_~x1~0_521 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| (ite (and (< .cse2 v_~size~0_301) (<= 0 .cse2)) 1 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_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| (ite (and (<= 0 v_~x1~0_521) (< v_~x1~0_521 v_~size~0_301)) 1 0)) (not (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_298| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_298|) (not (= 0 (ite (and (< .cse5 v_~size~0_301) (<= 0 .cse5)) 1 0))) (= (select .cse1 (+ v_~f~0.offset_297 (* .cse2 4))) v_~x2~0_437) (= |v_thread1Thread1of1ForFork0_~i~0#1_361| 1) (not (= (ite (and (< v_~x2~0_438 v_~size~0_301) (<= 0 v_~x2~0_438)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_301)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|)))))))) InVars {~x2~0=v_~x2~0_438, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, #memory_int=|v_#memory_int_426|, ~n~0=v_~n~0_291, ~x1~0=v_~x1~0_521, ~f~0.offset=v_~f~0.offset_297} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_275|, ~x2~0=v_~x2~0_437, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_232|, ~size~0=v_~size~0_301, ~f~0.base=v_~f~0.base_301, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_62|, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_204|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_240|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_298|, ~x1~0=v_~x1~0_520, ~f~0.offset=v_~f~0.offset_297, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_272|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_267|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_62|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_196|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_361|, #memory_int=|v_#memory_int_426|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_194|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_204|, ~n~0=v_~n~0_291, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_285|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_208|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, ~x2~0, 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, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread1Thread1of1ForFork0_#t~mem1#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 00:29:41,471 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 00:29:41,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4667 [2022-12-06 00:29:41,472 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 124 transitions, 1931 flow [2022-12-06 00:29:41,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:41,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:41,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:41,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:41,678 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,SelfDestructingSolverStorable33 [2022-12-06 00:29:41,679 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:41,679 INFO L85 PathProgramCache]: Analyzing trace with hash -272959584, now seen corresponding path program 1 times [2022-12-06 00:29:41,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:41,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823899157] [2022-12-06 00:29:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:41,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823899157] [2022-12-06 00:29:41,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823899157] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216619096] [2022-12-06 00:29:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:41,748 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:41,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 00:29:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:41,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:29:41,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:41,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216619096] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:41,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:41,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 00:29:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149787682] [2022-12-06 00:29:41,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:41,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:29:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:41,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:29:41,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:29:41,895 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 00:29:41,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 124 transitions, 1931 flow. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:41,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:41,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 00:29:41,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:42,152 INFO L130 PetriNetUnfolder]: 600/1133 cut-off events. [2022-12-06 00:29:42,152 INFO L131 PetriNetUnfolder]: For 11918/11918 co-relation queries the response was YES. [2022-12-06 00:29:42,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1133 events. 600/1133 cut-off events. For 11918/11918 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5598 event pairs, 283 based on Foata normal form. 22/1155 useless extension candidates. Maximal degree in co-relation 7159. Up to 985 conditions per place. [2022-12-06 00:29:42,158 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 106 selfloop transitions, 11 changer transitions 24/141 dead transitions. [2022-12-06 00:29:42,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 141 transitions, 2446 flow [2022-12-06 00:29:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:29:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:29:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-06 00:29:42,159 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24537037037037038 [2022-12-06 00:29:42,159 INFO L175 Difference]: Start difference. First operand has 111 places, 124 transitions, 1931 flow. Second operand 6 states and 53 transitions. [2022-12-06 00:29:42,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 141 transitions, 2446 flow [2022-12-06 00:29:42,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 141 transitions, 2063 flow, removed 169 selfloop flow, removed 8 redundant places. [2022-12-06 00:29:42,182 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 1355 flow [2022-12-06 00:29:42,182 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1355, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2022-12-06 00:29:42,183 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 88 predicate places. [2022-12-06 00:29:42,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:42,183 INFO L89 Accepts]: Start accepts. Operand has 109 places, 109 transitions, 1355 flow [2022-12-06 00:29:42,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:42,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:42,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 109 transitions, 1355 flow [2022-12-06 00:29:42,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 109 transitions, 1355 flow [2022-12-06 00:29:42,210 INFO L130 PetriNetUnfolder]: 79/310 cut-off events. [2022-12-06 00:29:42,210 INFO L131 PetriNetUnfolder]: For 1670/1674 co-relation queries the response was YES. [2022-12-06 00:29:42,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 310 events. 79/310 cut-off events. For 1670/1674 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1730 event pairs, 1 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 1458. Up to 104 conditions per place. [2022-12-06 00:29:42,213 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 109 transitions, 1355 flow [2022-12-06 00:29:42,213 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-06 00:29:42,213 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 [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 00:29:43,571 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:43,572 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1389 [2022-12-06 00:29:43,572 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 109 transitions, 1369 flow [2022-12-06 00:29:43,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:43,572 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:43,572 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:43,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:43,773 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 00:29:43,773 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash 731794055, now seen corresponding path program 1 times [2022-12-06 00:29:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:43,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103924275] [2022-12-06 00:29:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:43,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:43,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103924275] [2022-12-06 00:29:43,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103924275] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:43,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227254128] [2022-12-06 00:29:43,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:43,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:43,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:43,856 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:43,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 00:29:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:44,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 00:29:44,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:44,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:44,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:44,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227254128] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:44,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:44,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 12 [2022-12-06 00:29:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878280064] [2022-12-06 00:29:44,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:44,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:29:44,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:44,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:29:44,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:29:44,163 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:29:44,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 109 transitions, 1369 flow. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:44,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:44,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:29:44,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:44,578 INFO L130 PetriNetUnfolder]: 573/1080 cut-off events. [2022-12-06 00:29:44,578 INFO L131 PetriNetUnfolder]: For 7805/7805 co-relation queries the response was YES. [2022-12-06 00:29:44,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6633 conditions, 1080 events. 573/1080 cut-off events. For 7805/7805 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5276 event pairs, 243 based on Foata normal form. 14/1094 useless extension candidates. Maximal degree in co-relation 5934. Up to 893 conditions per place. [2022-12-06 00:29:44,583 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 82 selfloop transitions, 50 changer transitions 17/149 dead transitions. [2022-12-06 00:29:44,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 149 transitions, 2058 flow [2022-12-06 00:29:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:29:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:29:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 73 transitions. [2022-12-06 00:29:44,584 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19623655913978494 [2022-12-06 00:29:44,584 INFO L175 Difference]: Start difference. First operand has 97 places, 109 transitions, 1369 flow. Second operand 12 states and 73 transitions. [2022-12-06 00:29:44,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 149 transitions, 2058 flow [2022-12-06 00:29:44,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 149 transitions, 1884 flow, removed 45 selfloop flow, removed 10 redundant places. [2022-12-06 00:29:44,603 INFO L231 Difference]: Finished difference. Result has 105 places, 118 transitions, 1487 flow [2022-12-06 00:29:44,603 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1487, PETRI_PLACES=105, PETRI_TRANSITIONS=118} [2022-12-06 00:29:44,604 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 84 predicate places. [2022-12-06 00:29:44,604 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:44,604 INFO L89 Accepts]: Start accepts. Operand has 105 places, 118 transitions, 1487 flow [2022-12-06 00:29:44,604 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:44,604 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:44,605 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 118 transitions, 1487 flow [2022-12-06 00:29:44,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 118 transitions, 1487 flow [2022-12-06 00:29:44,634 INFO L130 PetriNetUnfolder]: 92/342 cut-off events. [2022-12-06 00:29:44,635 INFO L131 PetriNetUnfolder]: For 2588/2605 co-relation queries the response was YES. [2022-12-06 00:29:44,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 342 events. 92/342 cut-off events. For 2588/2605 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1963 event pairs, 8 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1861. Up to 91 conditions per place. [2022-12-06 00:29:44,637 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 118 transitions, 1487 flow [2022-12-06 00:29:44,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 00:29:44,642 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 00:29:44,731 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 00:29:45,023 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:29:45,028 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-06 00:29:45,028 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 116 transitions, 1488 flow [2022-12-06 00:29:45,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:45,028 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:45,028 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:45,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:45,234 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 00:29:45,234 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:45,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1817371637, now seen corresponding path program 1 times [2022-12-06 00:29:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:45,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542026373] [2022-12-06 00:29:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:45,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:45,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542026373] [2022-12-06 00:29:45,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542026373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:45,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290348989] [2022-12-06 00:29:45,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:45,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:45,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:45,350 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:45,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 00:29:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:45,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:29:45,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:45,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:45,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 00:29:45,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290348989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:45,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 00:29:45,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-12-06 00:29:45,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759790759] [2022-12-06 00:29:45,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:45,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:45,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:45,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:29:45,501 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:29:45,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 116 transitions, 1488 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:45,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:45,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:29:45,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:45,791 INFO L130 PetriNetUnfolder]: 553/1041 cut-off events. [2022-12-06 00:29:45,792 INFO L131 PetriNetUnfolder]: For 8965/8965 co-relation queries the response was YES. [2022-12-06 00:29:45,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6886 conditions, 1041 events. 553/1041 cut-off events. For 8965/8965 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5002 event pairs, 233 based on Foata normal form. 4/1045 useless extension candidates. Maximal degree in co-relation 6381. Up to 907 conditions per place. [2022-12-06 00:29:45,797 INFO L137 encePairwiseOnDemand]: 19/33 looper letters, 89 selfloop transitions, 35 changer transitions 8/132 dead transitions. [2022-12-06 00:29:45,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 132 transitions, 1914 flow [2022-12-06 00:29:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-06 00:29:45,798 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3090909090909091 [2022-12-06 00:29:45,798 INFO L175 Difference]: Start difference. First operand has 99 places, 116 transitions, 1488 flow. Second operand 5 states and 51 transitions. [2022-12-06 00:29:45,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 132 transitions, 1914 flow [2022-12-06 00:29:45,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 132 transitions, 1796 flow, removed 53 selfloop flow, removed 7 redundant places. [2022-12-06 00:29:45,816 INFO L231 Difference]: Finished difference. Result has 98 places, 117 transitions, 1487 flow [2022-12-06 00:29:45,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1487, PETRI_PLACES=98, PETRI_TRANSITIONS=117} [2022-12-06 00:29:45,816 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 00:29:45,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:45,817 INFO L89 Accepts]: Start accepts. Operand has 98 places, 117 transitions, 1487 flow [2022-12-06 00:29:45,817 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:45,817 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:45,817 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 117 transitions, 1487 flow [2022-12-06 00:29:45,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 117 transitions, 1487 flow [2022-12-06 00:29:45,846 INFO L130 PetriNetUnfolder]: 93/340 cut-off events. [2022-12-06 00:29:45,846 INFO L131 PetriNetUnfolder]: For 2362/2392 co-relation queries the response was YES. [2022-12-06 00:29:45,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 340 events. 93/340 cut-off events. For 2362/2392 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1929 event pairs, 8 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1871. Up to 89 conditions per place. [2022-12-06 00:29:45,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 117 transitions, 1487 flow [2022-12-06 00:29:45,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-06 00:29:45,855 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [767] $Ultimate##0-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_424| v_~f~0.base_299))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_295 (* v_~x2~0_434 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_295 (* v_~x1~0_516 4)))) (.cse1 (mod (* 3 v_~n~0_289) 4294967296)) (.cse4 (select .cse2 (+ v_~f~0.offset_295 (* .cse3 4))))) (and (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_299)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_263|) (= |v_thread1Thread1of1ForFork0_~i~0#1_355| (+ |v_thread1Thread1of1ForFork0_~i~0#1_357| 2)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_355| 4294967295) 4294967296) .cse1) (not (= (ite (and (<= 0 v_~x2~0_434) (< v_~x2~0_434 v_~size~0_299)) 1 0) 0)) (= v_~x1~0_514 (select .cse2 (+ v_~f~0.offset_295 (* .cse0 4)))) (not (= 0 (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_299)) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_263| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_279|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_296|) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_357| 4294967296) .cse1) (= v_~x2~0_433 (select .cse2 (+ v_~f~0.offset_295 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_299)) 1 0)) (not (= (ite (and (< v_~x1~0_516 v_~size~0_299) (<= 0 v_~x1~0_516)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_279| 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270| 0)))))) InVars {~x2~0=v_~x2~0_434, ~size~0=v_~size~0_299, ~f~0.base=v_~f~0.base_299, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_357|, #memory_int=|v_#memory_int_424|, ~n~0=v_~n~0_289, ~x1~0=v_~x1~0_516, ~f~0.offset=v_~f~0.offset_295} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_271|, ~x2~0=v_~x2~0_433, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_230|, ~size~0=v_~size~0_299, ~f~0.base=v_~f~0.base_299, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_202|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_238|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_296|, ~x1~0=v_~x1~0_514, ~f~0.offset=v_~f~0.offset_295, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_270|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_263|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_194|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_355|, #memory_int=|v_#memory_int_424|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_279|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_192|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_202|, ~n~0=v_~n~0_289, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_281|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_206|} 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 00:29:46,217 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:46,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 402 [2022-12-06 00:29:46,218 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 1479 flow [2022-12-06 00:29:46,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:46,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:46,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:46,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:46,423 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 00:29:46,423 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:46,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:46,424 INFO L85 PathProgramCache]: Analyzing trace with hash -47925937, now seen corresponding path program 1 times [2022-12-06 00:29:46,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:46,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199353470] [2022-12-06 00:29:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:46,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:46,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199353470] [2022-12-06 00:29:46,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199353470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:29:46,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:29:46,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:29:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717918341] [2022-12-06 00:29:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:29:46,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:29:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:46,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:29:46,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:29:46,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 00:29:46,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 116 transitions, 1479 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 00:29:46,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:46,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 00:29:46,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:46,768 INFO L130 PetriNetUnfolder]: 552/1037 cut-off events. [2022-12-06 00:29:46,768 INFO L131 PetriNetUnfolder]: For 8522/8522 co-relation queries the response was YES. [2022-12-06 00:29:46,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 1037 events. 552/1037 cut-off events. For 8522/8522 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4968 event pairs, 125 based on Foata normal form. 6/1043 useless extension candidates. Maximal degree in co-relation 6555. Up to 833 conditions per place. [2022-12-06 00:29:46,773 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 84 selfloop transitions, 45 changer transitions 2/131 dead transitions. [2022-12-06 00:29:46,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 131 transitions, 1897 flow [2022-12-06 00:29:46,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:29:46,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:29:46,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-12-06 00:29:46,774 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.296969696969697 [2022-12-06 00:29:46,774 INFO L175 Difference]: Start difference. First operand has 96 places, 116 transitions, 1479 flow. Second operand 5 states and 49 transitions. [2022-12-06 00:29:46,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 131 transitions, 1897 flow [2022-12-06 00:29:46,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 1815 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 00:29:46,789 INFO L231 Difference]: Finished difference. Result has 98 places, 115 transitions, 1499 flow [2022-12-06 00:29:46,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1499, PETRI_PLACES=98, PETRI_TRANSITIONS=115} [2022-12-06 00:29:46,790 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 77 predicate places. [2022-12-06 00:29:46,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:46,790 INFO L89 Accepts]: Start accepts. Operand has 98 places, 115 transitions, 1499 flow [2022-12-06 00:29:46,790 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:46,790 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:46,790 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 115 transitions, 1499 flow [2022-12-06 00:29:46,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 115 transitions, 1499 flow [2022-12-06 00:29:46,830 INFO L130 PetriNetUnfolder]: 93/340 cut-off events. [2022-12-06 00:29:46,830 INFO L131 PetriNetUnfolder]: For 2547/2577 co-relation queries the response was YES. [2022-12-06 00:29:46,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 340 events. 93/340 cut-off events. For 2547/2577 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1926 event pairs, 8 based on Foata normal form. 2/335 useless extension candidates. Maximal degree in co-relation 1679. Up to 91 conditions per place. [2022-12-06 00:29:46,833 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 115 transitions, 1499 flow [2022-12-06 00:29:46,833 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-06 00:29:46,834 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:29:46,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 00:29:46,835 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 115 transitions, 1499 flow [2022-12-06 00:29:46,835 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 00:29:46,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:46,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:46,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 00:29:46,835 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash 938567221, now seen corresponding path program 1 times [2022-12-06 00:29:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:46,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263266710] [2022-12-06 00:29:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:46,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:46,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263266710] [2022-12-06 00:29:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263266710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:46,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951633744] [2022-12-06 00:29:46,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:46,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:46,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:46,924 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:46,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 00:29:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:47,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 00:29:47,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:47,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:47,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951633744] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:47,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:47,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-06 00:29:47,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838922651] [2022-12-06 00:29:47,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:47,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:29:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:47,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:29:47,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-12-06 00:29:47,252 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 00:29:47,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 115 transitions, 1499 flow. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:47,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:47,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 00:29:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:29:47,982 INFO L130 PetriNetUnfolder]: 533/1005 cut-off events. [2022-12-06 00:29:47,982 INFO L131 PetriNetUnfolder]: For 8678/8678 co-relation queries the response was YES. [2022-12-06 00:29:47,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6661 conditions, 1005 events. 533/1005 cut-off events. For 8678/8678 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4790 event pairs, 117 based on Foata normal form. 20/1025 useless extension candidates. Maximal degree in co-relation 5746. Up to 657 conditions per place. [2022-12-06 00:29:47,990 INFO L137 encePairwiseOnDemand]: 16/31 looper letters, 66 selfloop transitions, 26 changer transitions 51/143 dead transitions. [2022-12-06 00:29:47,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 143 transitions, 2071 flow [2022-12-06 00:29:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:29:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:29:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-12-06 00:29:47,992 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.22983870967741934 [2022-12-06 00:29:47,992 INFO L175 Difference]: Start difference. First operand has 98 places, 115 transitions, 1499 flow. Second operand 8 states and 57 transitions. [2022-12-06 00:29:47,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 143 transitions, 2071 flow [2022-12-06 00:29:48,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 2000 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 00:29:48,016 INFO L231 Difference]: Finished difference. Result has 103 places, 80 transitions, 877 flow [2022-12-06 00:29:48,016 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=877, PETRI_PLACES=103, PETRI_TRANSITIONS=80} [2022-12-06 00:29:48,016 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 00:29:48,016 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:29:48,017 INFO L89 Accepts]: Start accepts. Operand has 103 places, 80 transitions, 877 flow [2022-12-06 00:29:48,017 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:29:48,017 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:29:48,017 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 80 transitions, 877 flow [2022-12-06 00:29:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 80 transitions, 877 flow [2022-12-06 00:29:48,042 INFO L130 PetriNetUnfolder]: 58/251 cut-off events. [2022-12-06 00:29:48,042 INFO L131 PetriNetUnfolder]: For 1578/1609 co-relation queries the response was YES. [2022-12-06 00:29:48,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 251 events. 58/251 cut-off events. For 1578/1609 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1360 event pairs, 7 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 1218. Up to 65 conditions per place. [2022-12-06 00:29:48,044 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 80 transitions, 877 flow [2022-12-06 00:29:48,044 INFO L188 LiptonReduction]: Number of co-enabled transitions 288 [2022-12-06 00:29:48,160 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:29:48,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 145 [2022-12-06 00:29:48,161 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 863 flow [2022-12-06 00:29:48,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:48,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:29:48,161 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:29:48,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-06 00:29:48,368 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,SelfDestructingSolverStorable38 [2022-12-06 00:29:48,368 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:29:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:29:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash -999707263, now seen corresponding path program 1 times [2022-12-06 00:29:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:29:48,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490815436] [2022-12-06 00:29:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:29:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:48,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:29:48,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490815436] [2022-12-06 00:29:48,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490815436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:29:48,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931631289] [2022-12-06 00:29:48,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:29:48,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:29:48,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:29:48,453 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:29:48,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 00:29:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:29:48,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 00:29:48,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:29:48,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:29:48,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:29:48,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:48,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:29:49,093 INFO L321 Elim1Store]: treesize reduction 259, result has 10.4 percent of original size [2022-12-06 00:29:49,093 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 00:29:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:49,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:29:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:29:50,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931631289] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:29:50,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:29:50,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2022-12-06 00:29:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303219149] [2022-12-06 00:29:50,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:29:50,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 00:29:50,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:29:50,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 00:29:50,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=193, Unknown=1, NotChecked=0, Total=240 [2022-12-06 00:29:50,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 00:29:50,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 863 flow. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:29:50,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:29:50,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 00:29:50,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:18,262 WARN L233 SmtUtils]: Spent 22.71s on a formula simplification. DAG size of input: 178 DAG size of output: 175 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:30:18,469 INFO L130 PetriNetUnfolder]: 422/813 cut-off events. [2022-12-06 00:30:18,469 INFO L131 PetriNetUnfolder]: For 5891/5891 co-relation queries the response was YES. [2022-12-06 00:30:18,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5065 conditions, 813 events. 422/813 cut-off events. For 5891/5891 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3754 event pairs, 103 based on Foata normal form. 2/815 useless extension candidates. Maximal degree in co-relation 4751. Up to 616 conditions per place. [2022-12-06 00:30:18,473 INFO L137 encePairwiseOnDemand]: 13/24 looper letters, 95 selfloop transitions, 18 changer transitions 7/120 dead transitions. [2022-12-06 00:30:18,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 120 transitions, 1446 flow [2022-12-06 00:30:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:30:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:30:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 72 transitions. [2022-12-06 00:30:18,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23076923076923078 [2022-12-06 00:30:18,475 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 863 flow. Second operand 13 states and 72 transitions. [2022-12-06 00:30:18,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 120 transitions, 1446 flow [2022-12-06 00:30:18,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 1271 flow, removed 35 selfloop flow, removed 16 redundant places. [2022-12-06 00:30:18,485 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 842 flow [2022-12-06 00:30:18,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=842, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2022-12-06 00:30:18,485 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 00:30:18,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:18,486 INFO L89 Accepts]: Start accepts. Operand has 91 places, 83 transitions, 842 flow [2022-12-06 00:30:18,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:18,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:18,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 83 transitions, 842 flow [2022-12-06 00:30:18,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 842 flow [2022-12-06 00:30:18,507 INFO L130 PetriNetUnfolder]: 59/250 cut-off events. [2022-12-06 00:30:18,507 INFO L131 PetriNetUnfolder]: For 1352/1375 co-relation queries the response was YES. [2022-12-06 00:30:18,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 250 events. 59/250 cut-off events. For 1352/1375 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1366 event pairs, 7 based on Foata normal form. 2/244 useless extension candidates. Maximal degree in co-relation 1032. Up to 67 conditions per place. [2022-12-06 00:30:18,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 83 transitions, 842 flow [2022-12-06 00:30:18,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 00:30:18,521 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 00:30:19,920 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [775] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_434| v_~f~0.base_309))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_305 (* v_~x2~0_456 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_305 (* .cse1 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_305 (* .cse7 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_305 (* .cse0 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_305 (* .cse10 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_305 (* .cse8 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_305 (* 4 .cse2))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_305 (* .cse9 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_305 (* .cse6 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_305 (* .cse5 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_305 (* .cse11 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_309) (<= 0 .cse0)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_307| 12) (not (= (ite (and (< .cse1 v_~size~0_309) (<= 0 .cse1)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_309)) 1 0))) (= v_~x2~0_454 (select .cse3 (+ v_~f~0.offset_305 (* .cse4 4)))) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_309)) 1 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281| 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_309)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_456 v_~size~0_309) (<= 0 v_~x2~0_456)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_309)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_307| 4294967293) 4294967296) (mod (* 3 v_~n~0_299) 4294967296)) (not (= (ite (and (< .cse7 v_~size~0_309) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_309) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_309)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_309)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_309)) 1 0) 0))))))))))))))) InVars {~x2~0=v_~x2~0_456, ~size~0=v_~size~0_309, ~f~0.base=v_~f~0.base_309, #memory_int=|v_#memory_int_434|, ~n~0=v_~n~0_299, ~f~0.offset=v_~f~0.offset_305} OutVars{~x2~0=v_~x2~0_454, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_241|, ~size~0=v_~size~0_309, ~f~0.base=v_~f~0.base_309, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_213|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_249|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_307|, ~f~0.offset=v_~f~0.offset_305, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_281|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_205|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_203|, #memory_int=|v_#memory_int_434|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_213|, ~n~0=v_~n~0_299, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_217|} 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 00:30:20,870 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 00:30:21,357 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 00:30:21,545 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:30:21,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3060 [2022-12-06 00:30:21,546 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 908 flow [2022-12-06 00:30:21,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:21,546 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:21,546 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:21,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-06 00:30:21,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-06 00:30:21,751 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:21,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash -626596837, now seen corresponding path program 1 times [2022-12-06 00:30:21,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:21,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759835950] [2022-12-06 00:30:21,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:21,879 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 00:30:21,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:21,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759835950] [2022-12-06 00:30:21,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759835950] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:21,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54837028] [2022-12-06 00:30:21,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:21,881 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:21,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-06 00:30:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:22,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:30:22,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:22,163 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 00:30:22,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:22,192 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 00:30:22,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54837028] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:22,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:22,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-12-06 00:30:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186763359] [2022-12-06 00:30:22,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:22,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:30:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:22,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:30:22,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:30:22,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:30:22,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 908 flow. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:22,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:22,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:30:22,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:22,390 INFO L130 PetriNetUnfolder]: 405/774 cut-off events. [2022-12-06 00:30:22,390 INFO L131 PetriNetUnfolder]: For 5120/5120 co-relation queries the response was YES. [2022-12-06 00:30:22,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 774 events. 405/774 cut-off events. For 5120/5120 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3462 event pairs, 213 based on Foata normal form. 12/786 useless extension candidates. Maximal degree in co-relation 4100. Up to 725 conditions per place. [2022-12-06 00:30:22,394 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 79 selfloop transitions, 0 changer transitions 16/95 dead transitions. [2022-12-06 00:30:22,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 1228 flow [2022-12-06 00:30:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 00:30:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 00:30:22,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 00:30:22,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2022-12-06 00:30:22,395 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 908 flow. Second operand 5 states and 40 transitions. [2022-12-06 00:30:22,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 1228 flow [2022-12-06 00:30:22,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 1093 flow, removed 47 selfloop flow, removed 7 redundant places. [2022-12-06 00:30:22,403 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 742 flow [2022-12-06 00:30:22,403 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=742, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2022-12-06 00:30:22,404 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2022-12-06 00:30:22,404 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:30:22,404 INFO L89 Accepts]: Start accepts. Operand has 87 places, 79 transitions, 742 flow [2022-12-06 00:30:22,404 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:30:22,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:30:22,404 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 79 transitions, 742 flow [2022-12-06 00:30:22,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 79 transitions, 742 flow [2022-12-06 00:30:22,430 INFO L130 PetriNetUnfolder]: 55/231 cut-off events. [2022-12-06 00:30:22,431 INFO L131 PetriNetUnfolder]: For 1048/1067 co-relation queries the response was YES. [2022-12-06 00:30:22,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 231 events. 55/231 cut-off events. For 1048/1067 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1188 event pairs, 4 based on Foata normal form. 3/228 useless extension candidates. Maximal degree in co-relation 993. Up to 66 conditions per place. [2022-12-06 00:30:22,432 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 79 transitions, 742 flow [2022-12-06 00:30:22,432 INFO L188 LiptonReduction]: Number of co-enabled transitions 278 [2022-12-06 00:30:22,557 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:30:22,557 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 153 [2022-12-06 00:30:22,558 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 736 flow [2022-12-06 00:30:22,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:30:22,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:30:22,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:30:22,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-06 00:30:22,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:22,758 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:30:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:30:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1832882375, now seen corresponding path program 1 times [2022-12-06 00:30:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:30:22,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945252298] [2022-12-06 00:30:22,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:30:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:22,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:30:22,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945252298] [2022-12-06 00:30:22,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945252298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:30:22,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182283330] [2022-12-06 00:30:22,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:30:22,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:30:22,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:30:22,834 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:30:22,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-06 00:30:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:30:22,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-06 00:30:22,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:30:22,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 00:30:22,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 00:30:22,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:30:23,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 00:30:24,331 INFO L321 Elim1Store]: treesize reduction 793, result has 5.7 percent of original size [2022-12-06 00:30:24,332 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 00:30:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:24,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:30:26,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:30:26,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182283330] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:30:26,358 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:30:26,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-12-06 00:30:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291144060] [2022-12-06 00:30:26,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:30:26,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 00:30:26,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:30:26,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 00:30:26,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=165, Unknown=2, NotChecked=0, Total=210 [2022-12-06 00:30:26,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 00:30:26,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 736 flow. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 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 00:30:26,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:30:26,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 00:30:26,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:30:52,743 WARN L233 SmtUtils]: Spent 25.25s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:31:26,645 WARN L233 SmtUtils]: Spent 32.87s on a formula simplification. DAG size of input: 256 DAG size of output: 253 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 00:31:28,412 INFO L130 PetriNetUnfolder]: 401/758 cut-off events. [2022-12-06 00:31:28,412 INFO L131 PetriNetUnfolder]: For 3984/3984 co-relation queries the response was YES. [2022-12-06 00:31:28,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 758 events. 401/758 cut-off events. For 3984/3984 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3325 event pairs, 95 based on Foata normal form. 4/762 useless extension candidates. Maximal degree in co-relation 4220. Up to 629 conditions per place. [2022-12-06 00:31:28,416 INFO L137 encePairwiseOnDemand]: 13/27 looper letters, 91 selfloop transitions, 20 changer transitions 9/120 dead transitions. [2022-12-06 00:31:28,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 120 transitions, 1331 flow [2022-12-06 00:31:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 00:31:28,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 00:31:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2022-12-06 00:31:28,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2037037037037037 [2022-12-06 00:31:28,416 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 736 flow. Second operand 14 states and 77 transitions. [2022-12-06 00:31:28,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 120 transitions, 1331 flow [2022-12-06 00:31:28,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 120 transitions, 1290 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-06 00:31:28,424 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 874 flow [2022-12-06 00:31:28,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=874, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2022-12-06 00:31:28,424 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 73 predicate places. [2022-12-06 00:31:28,425 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:28,425 INFO L89 Accepts]: Start accepts. Operand has 94 places, 87 transitions, 874 flow [2022-12-06 00:31:28,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:28,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:28,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 87 transitions, 874 flow [2022-12-06 00:31:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 874 flow [2022-12-06 00:31:28,446 INFO L130 PetriNetUnfolder]: 59/235 cut-off events. [2022-12-06 00:31:28,446 INFO L131 PetriNetUnfolder]: For 1212/1231 co-relation queries the response was YES. [2022-12-06 00:31:28,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 235 events. 59/235 cut-off events. For 1212/1231 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1180 event pairs, 4 based on Foata normal form. 3/232 useless extension candidates. Maximal degree in co-relation 1058. Up to 72 conditions per place. [2022-12-06 00:31:28,448 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 874 flow [2022-12-06 00:31:28,448 INFO L188 LiptonReduction]: Number of co-enabled transitions 304 [2022-12-06 00:31:28,691 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 00:31:35,093 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [787] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_455| v_~f~0.base_325))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_321 (* v_~x2~0_476 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_321 (* 4 .cse6))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_321 (* .cse8 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_321 (* .cse10 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_321 (* .cse2 4))))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_321 (* 4 .cse0))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_321 (* .cse5 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_321 (* 4 .cse11))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_321 (* .cse7 4))))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_321 (* .cse9 4))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_321 (* .cse12 4))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_321 (* .cse13 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_321 (* .cse14 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_321 (* .cse1 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_297|) (not (= (ite (and (< .cse0 v_~size~0_325) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_325) (<= 0 .cse1)) 1 0) 0)) (not (= (ite (and (< .cse2 v_~size~0_325) (<= 0 .cse2)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_297| 0)) (= (select .cse3 (+ v_~f~0.offset_321 (* .cse4 4))) v_~x2~0_474) (< 12 (mod (* 3 v_~n~0_315) 4294967296)) (not (= (ite (and (< .cse5 v_~size~0_325) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_325) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_325)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_325) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_332| 15) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_325)) 1 0))) (not (= (ite (and (< .cse10 v_~size~0_325) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_325)) 1 0) 0)) (= (ite (and (< .cse4 v_~size~0_325) (<= 0 .cse4)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_325)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_325) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_325)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_476 v_~size~0_325) (<= 0 v_~x2~0_476)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_476, ~size~0=v_~size~0_325, ~f~0.base=v_~f~0.base_325, #memory_int=|v_#memory_int_455|, ~n~0=v_~n~0_315, ~f~0.offset=v_~f~0.offset_321} OutVars{~x2~0=v_~x2~0_474, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_257|, ~size~0=v_~size~0_325, ~f~0.base=v_~f~0.base_325, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_229|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_265|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_332|, ~f~0.offset=v_~f~0.offset_321, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_297|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_221|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_219|, #memory_int=|v_#memory_int_455|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_229|, ~n~0=v_~n~0_315, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_233|} 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 00:31:36,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L49-2: Formula: (let ((.cse4 (select |v_#memory_int_480| v_~f~0.base_347))) (let ((.cse9 (select .cse4 (+ (* v_~x2~0_530 4) v_~f~0.offset_343)))) (let ((.cse7 (select .cse4 (+ v_~f~0.offset_343 (* .cse9 4))))) (let ((.cse12 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse7))))) (let ((.cse14 (select .cse4 (+ v_~f~0.offset_343 (* .cse12 4))))) (let ((.cse1 (select .cse4 (+ v_~f~0.offset_343 (* .cse14 4))))) (let ((.cse11 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse1))))) (let ((.cse3 (select .cse4 (+ v_~f~0.offset_343 (* .cse11 4))))) (let ((.cse13 (select .cse4 (+ v_~f~0.offset_343 (* .cse3 4))))) (let ((.cse8 (select .cse4 (+ v_~f~0.offset_343 (* .cse13 4))))) (let ((.cse10 (select .cse4 (+ v_~f~0.offset_343 (* .cse8 4))))) (let ((.cse6 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse10))))) (let ((.cse0 (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse6))))) (let ((.cse5 (select .cse4 (+ v_~f~0.offset_343 (* .cse0 4))))) (let ((.cse2 (select .cse4 (+ v_~f~0.offset_343 (* .cse5 4))))) (and (= (ite (and (< v_~x1~0_620 v_~size~0_347) (<= 0 v_~x1~0_620)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330|) (not (= (ite (and (< .cse0 v_~size~0_347) (<= 0 .cse0)) 1 0) 0)) (not (= (ite (and (< .cse1 v_~size~0_347) (<= 0 .cse1)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_300| (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_347)) 1 0)) (not (= (ite (and (< .cse3 v_~size~0_347) (<= 0 .cse3)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_343 (* 4 .cse2))) v_~x2~0_529) (< 12 (mod (* 3 v_~n~0_337) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_444| 1) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_347)) 1 0) 0)) (= (select .cse4 (+ v_~f~0.offset_343 (* v_~x1~0_620 4))) v_~x1~0_619) (not (= (ite (and (<= 0 v_~x2~0_530) (< v_~x2~0_530 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_347) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_347)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332| 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_347) (<= 0 .cse9)) 1 0) 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_347)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346| 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_347)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_347) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_347) (<= 0 .cse14)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_373| 15))))))))))))))))) InVars {~x2~0=v_~x2~0_530, ~size~0=v_~size~0_347, ~f~0.base=v_~f~0.base_347, #memory_int=|v_#memory_int_480|, ~n~0=v_~n~0_337, ~x1~0=v_~x1~0_620, ~f~0.offset=v_~f~0.offset_343} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_338|, ~x2~0=v_~x2~0_529, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_292|, ~size~0=v_~size~0_347, ~f~0.base=v_~f~0.base_347, 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_373|, ~x1~0=v_~x1~0_619, ~f~0.offset=v_~f~0.offset_343, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_332|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_256|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_444|, #memory_int=|v_#memory_int_480|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_346|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_254|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_264|, ~n~0=v_~n~0_337, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_348|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_268|} 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 00:31:43,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [806] $Ultimate##0-->L59-2: Formula: (let ((.cse3 (select |v_#memory_int_482| v_~f~0.base_349))) (let ((.cse12 (select .cse3 (+ v_~f~0.offset_345 (* v_~x2~0_535 4))))) (let ((.cse10 (select .cse3 (+ v_~f~0.offset_345 (* .cse12 4))))) (let ((.cse11 (select .cse3 (+ v_~f~0.offset_345 (* .cse10 4))))) (let ((.cse6 (select .cse3 (+ v_~f~0.offset_345 (* .cse11 4))))) (let ((.cse1 (select .cse3 (+ v_~f~0.offset_345 (* 4 .cse6))))) (let ((.cse14 (select .cse3 (+ v_~f~0.offset_345 (* .cse1 4))))) (let ((.cse16 (select .cse3 (+ (* .cse14 4) v_~f~0.offset_345)))) (let ((.cse5 (select .cse3 (+ v_~f~0.offset_345 (* .cse16 4))))) (let ((.cse15 (select .cse3 (+ v_~f~0.offset_345 (* .cse5 4))))) (let ((.cse13 (select .cse3 (+ v_~f~0.offset_345 (* .cse15 4))))) (let ((.cse4 (select .cse3 (+ v_~f~0.offset_345 (* .cse13 4))))) (let ((.cse7 (select .cse3 (+ v_~f~0.offset_345 (* .cse4 4))))) (let ((.cse8 (select .cse3 (+ v_~f~0.offset_345 (* .cse7 4))))) (let ((.cse17 (select .cse3 (+ v_~f~0.offset_345 (* .cse8 4))))) (let ((.cse9 (select .cse3 (+ v_~f~0.offset_345 (* .cse17 4))))) (let ((.cse2 (select .cse3 (+ v_~f~0.offset_345 (* .cse9 4))))) (let ((.cse0 (select .cse3 (+ v_~f~0.offset_345 (* .cse2 4))))) (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_349)) 1 0)) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_349)) 1 0) 0)) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_349)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_345 (* v_~x1~0_624 4))) v_~x1~0_623) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_349)) 1 0) 0)) (= (select .cse3 (+ v_~f~0.offset_345 (* .cse0 4))) v_~x2~0_533) (= (ite (and (<= 0 v_~x1~0_624) (< v_~x1~0_624 v_~size~0_349)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332|) (not (= (ite (and (< .cse5 v_~size~0_349) (<= 0 .cse5)) 1 0) 0)) (< 15 (mod (* 3 v_~n~0_339) 4294967296)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_349)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|) (= |v_thread1Thread1of1ForFork0_~i~0#1_446| 1) (not (= (ite (and (< .cse7 v_~size~0_349) (<= 0 .cse7)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_349) (<= 0 .cse8)) 1 0) 0)) (not (= (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_349)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_375| 18) (not (= (ite (and (< .cse10 v_~size~0_349) (<= 0 .cse10)) 1 0) 0)) (not (= (ite (and (< .cse11 v_~size~0_349) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_349)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_349) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (<= 0 .cse14) (< .cse14 v_~size~0_349)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334| 0)) (not (= (ite (and (< .cse15 v_~size~0_349) (<= 0 .cse15)) 1 0) 0)) (not (= (ite (and (< .cse16 v_~size~0_349) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (<= 0 v_~x2~0_535) (< v_~x2~0_535 v_~size~0_349)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_349)) 1 0) 0))))))))))))))))))))) InVars {~x2~0=v_~x2~0_535, ~size~0=v_~size~0_349, ~f~0.base=v_~f~0.base_349, #memory_int=|v_#memory_int_482|, ~n~0=v_~n~0_339, ~x1~0=v_~x1~0_624, ~f~0.offset=v_~f~0.offset_345} OutVars{~x2~0=v_~x2~0_533, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_340|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_294|, ~size~0=v_~size~0_349, ~f~0.base=v_~f~0.base_349, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_266|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_302|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_375|, ~x1~0=v_~x1~0_623, ~f~0.offset=v_~f~0.offset_345, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_334|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_332|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_258|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_446|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_256|, #memory_int=|v_#memory_int_482|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_348|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_266|, ~n~0=v_~n~0_339, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_270|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_350|} 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 00:31:45,904 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [810] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_486| v_~f~0.base_353))) (let ((.cse20 (select .cse1 (+ v_~f~0.offset_349 (* v_~x2~0_545 4))))) (let ((.cse13 (select .cse1 (+ v_~f~0.offset_349 (* .cse20 4))))) (let ((.cse12 (select .cse1 (+ v_~f~0.offset_349 (* .cse13 4))))) (let ((.cse18 (select .cse1 (+ v_~f~0.offset_349 (* .cse12 4))))) (let ((.cse15 (select .cse1 (+ v_~f~0.offset_349 (* .cse18 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse15))))) (let ((.cse16 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse2))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_349 (* .cse16 4))))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_349 (* .cse4 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_349 (* .cse3 4))))) (let ((.cse11 (select .cse1 (+ v_~f~0.offset_349 (* .cse5 4))))) (let ((.cse10 (select .cse1 (+ v_~f~0.offset_349 (* .cse11 4))))) (let ((.cse8 (select .cse1 (+ v_~f~0.offset_349 (* .cse10 4))))) (let ((.cse14 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse8))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_349 (* .cse14 4))))) (let ((.cse19 (select .cse1 (+ v_~f~0.offset_349 (* 4 .cse0))))) (let ((.cse17 (select .cse1 (+ v_~f~0.offset_349 (* .cse19 4))))) (let ((.cse6 (select .cse1 (+ v_~f~0.offset_349 (* .cse17 4))))) (let ((.cse7 (select .cse1 (+ v_~f~0.offset_349 (* .cse6 4))))) (let ((.cse9 (select .cse1 (+ v_~f~0.offset_349 (* .cse7 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_353) (<= 0 .cse0)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_349 (* v_~x1~0_634 4))) v_~x1~0_633) (not (= (ite (and (< .cse2 v_~size~0_353) (<= 0 .cse2)) 1 0) 0)) (< 18 (mod (* 3 v_~n~0_343) 4294967296)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_353)) 1 0) 0)) (= 21 |v_thread2Thread1of1ForFork1_~i~1#1_381|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_353)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_338| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_354|) (not (= (ite (and (< .cse5 v_~size~0_353) (<= 0 .cse5)) 1 0) 0)) (not (= (ite (and (< .cse6 v_~size~0_353) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< .cse8 v_~size~0_353) (<= 0 .cse8)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_353)) 1 0)) (not (= (ite (and (<= 0 .cse10) (< .cse10 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (<= 0 .cse11) (< .cse11 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (<= 0 .cse12) (< .cse12 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< .cse13 v_~size~0_353) (<= 0 .cse13)) 1 0) 0)) (not (= (ite (and (< .cse14 v_~size~0_353) (<= 0 .cse14)) 1 0) 0)) (not (= (ite (and (< .cse15 v_~size~0_353) (<= 0 .cse15)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_349 (* .cse9 4))) v_~x2~0_543) (= |v_thread1Thread1of1ForFork0_~i~0#1_452| 1) (not (= (ite (and (< .cse16 v_~size~0_353) (<= 0 .cse16)) 1 0) 0)) (not (= (ite (and (<= 0 .cse17) (< .cse17 v_~size~0_353)) 1 0) 0)) (not (= (ite (and (< v_~x2~0_545 v_~size~0_353) (<= 0 v_~x2~0_545)) 1 0) 0)) (= (ite (and (< v_~x1~0_634 v_~size~0_353) (<= 0 v_~x1~0_634)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_338|) (not (= (ite (and (<= 0 .cse18) (< .cse18 v_~size~0_353)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_354| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_340|) (not (= (ite (and (< .cse19 v_~size~0_353) (<= 0 .cse19)) 1 0) 0)) (not (= (ite (and (< .cse20 v_~size~0_353) (<= 0 .cse20)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_340| 0)))))))))))))))))))))))) InVars {~x2~0=v_~x2~0_545, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_353, #memory_int=|v_#memory_int_486|, ~n~0=v_~n~0_343, ~x1~0=v_~x1~0_634, ~f~0.offset=v_~f~0.offset_349} OutVars{~x2~0=v_~x2~0_543, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_346|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_300|, ~size~0=v_~size~0_353, ~f~0.base=v_~f~0.base_353, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_272|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_308|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_381|, ~x1~0=v_~x1~0_633, ~f~0.offset=v_~f~0.offset_349, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_340|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_338|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_264|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_452|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_262|, #memory_int=|v_#memory_int_486|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_354|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_272|, ~n~0=v_~n~0_343, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_276|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_356|} 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 00:31:49,353 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:31:49,353 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20928 [2022-12-06 00:31:49,353 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 86 transitions, 918 flow [2022-12-06 00:31:49,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 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 00:31:49,353 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:49,354 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:49,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:49,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:49,554 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash 917190322, now seen corresponding path program 1 times [2022-12-06 00:31:49,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10333108] [2022-12-06 00:31:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:49,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:49,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10333108] [2022-12-06 00:31:49,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10333108] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:49,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438300158] [2022-12-06 00:31:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:49,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:49,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:49,656 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:31:49,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-06 00:31:49,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:49,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:31:49,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:49,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438300158] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:49,868 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:49,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-12-06 00:31:49,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851392823] [2022-12-06 00:31:49,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:49,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:31:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:49,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:31:49,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:31:49,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 00:31:49,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 86 transitions, 918 flow. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:49,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:49,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 00:31:49,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:50,403 INFO L130 PetriNetUnfolder]: 469/892 cut-off events. [2022-12-06 00:31:50,403 INFO L131 PetriNetUnfolder]: For 5832/5832 co-relation queries the response was YES. [2022-12-06 00:31:50,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5342 conditions, 892 events. 469/892 cut-off events. For 5832/5832 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4087 event pairs, 196 based on Foata normal form. 18/908 useless extension candidates. Maximal degree in co-relation 5183. Up to 622 conditions per place. [2022-12-06 00:31:50,408 INFO L137 encePairwiseOnDemand]: 18/34 looper letters, 83 selfloop transitions, 5 changer transitions 57/145 dead transitions. [2022-12-06 00:31:50,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 145 transitions, 1799 flow [2022-12-06 00:31:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 00:31:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 00:31:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 99 transitions. [2022-12-06 00:31:50,409 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17128027681660898 [2022-12-06 00:31:50,409 INFO L175 Difference]: Start difference. First operand has 91 places, 86 transitions, 918 flow. Second operand 17 states and 99 transitions. [2022-12-06 00:31:50,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 145 transitions, 1799 flow [2022-12-06 00:31:50,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 145 transitions, 1612 flow, removed 76 selfloop flow, removed 10 redundant places. [2022-12-06 00:31:50,418 INFO L231 Difference]: Finished difference. Result has 103 places, 70 transitions, 657 flow [2022-12-06 00:31:50,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=657, PETRI_PLACES=103, PETRI_TRANSITIONS=70} [2022-12-06 00:31:50,418 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 82 predicate places. [2022-12-06 00:31:50,419 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:50,419 INFO L89 Accepts]: Start accepts. Operand has 103 places, 70 transitions, 657 flow [2022-12-06 00:31:50,419 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:50,419 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:50,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 70 transitions, 657 flow [2022-12-06 00:31:50,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 70 transitions, 657 flow [2022-12-06 00:31:50,437 INFO L130 PetriNetUnfolder]: 56/230 cut-off events. [2022-12-06 00:31:50,437 INFO L131 PetriNetUnfolder]: For 1427/1445 co-relation queries the response was YES. [2022-12-06 00:31:50,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1084 conditions, 230 events. 56/230 cut-off events. For 1427/1445 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1185 event pairs, 4 based on Foata normal form. 2/226 useless extension candidates. Maximal degree in co-relation 1045. Up to 69 conditions per place. [2022-12-06 00:31:50,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 70 transitions, 657 flow [2022-12-06 00:31:50,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 264 [2022-12-06 00:31:50,576 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:50,577 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 00:31:50,577 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 663 flow [2022-12-06 00:31:50,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:50,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:50,577 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:50,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-06 00:31:50,777 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,SelfDestructingSolverStorable42 [2022-12-06 00:31:50,778 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash -270304831, now seen corresponding path program 1 times [2022-12-06 00:31:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:50,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353991811] [2022-12-06 00:31:50,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:51,942 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 00:31:51,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353991811] [2022-12-06 00:31:51,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353991811] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015132321] [2022-12-06 00:31:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:51,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:51,944 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 00:31:51,947 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 00:31:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:52,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 00:31:52,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:52,149 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:31:52,150 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 00:31:52,158 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 00:31:52,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:52,314 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-06 00:31:52,314 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 51 treesize of output 177 [2022-12-06 00:31:52,560 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 00:31:52,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015132321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:52,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:52,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 3] total 12 [2022-12-06 00:31:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665479577] [2022-12-06 00:31:52,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:52,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 00:31:52,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:52,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 00:31:52,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-06 00:31:52,561 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 00:31:52,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 663 flow. Second operand has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:52,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:52,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 00:31:52,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:52,878 INFO L130 PetriNetUnfolder]: 434/809 cut-off events. [2022-12-06 00:31:52,878 INFO L131 PetriNetUnfolder]: For 5257/5257 co-relation queries the response was YES. [2022-12-06 00:31:52,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4812 conditions, 809 events. 434/809 cut-off events. For 5257/5257 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3610 event pairs, 107 based on Foata normal form. 1/810 useless extension candidates. Maximal degree in co-relation 4732. Up to 758 conditions per place. [2022-12-06 00:31:52,882 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 80 selfloop transitions, 17 changer transitions 1/98 dead transitions. [2022-12-06 00:31:52,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 1118 flow [2022-12-06 00:31:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:31:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:31:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-12-06 00:31:52,883 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28804347826086957 [2022-12-06 00:31:52,883 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 663 flow. Second operand 8 states and 53 transitions. [2022-12-06 00:31:52,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 1118 flow [2022-12-06 00:31:52,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 1066 flow, removed 18 selfloop flow, removed 8 redundant places. [2022-12-06 00:31:52,890 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 842 flow [2022-12-06 00:31:52,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=842, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2022-12-06 00:31:52,891 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 62 predicate places. [2022-12-06 00:31:52,891 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:52,891 INFO L89 Accepts]: Start accepts. Operand has 83 places, 82 transitions, 842 flow [2022-12-06 00:31:52,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:52,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:52,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 82 transitions, 842 flow [2022-12-06 00:31:52,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 82 transitions, 842 flow [2022-12-06 00:31:52,911 INFO L130 PetriNetUnfolder]: 65/254 cut-off events. [2022-12-06 00:31:52,911 INFO L131 PetriNetUnfolder]: For 1188/1209 co-relation queries the response was YES. [2022-12-06 00:31:52,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 254 events. 65/254 cut-off events. For 1188/1209 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1358 event pairs, 5 based on Foata normal form. 3/250 useless extension candidates. Maximal degree in co-relation 1102. Up to 79 conditions per place. [2022-12-06 00:31:52,913 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 82 transitions, 842 flow [2022-12-06 00:31:52,913 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-06 00:31:56,185 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 00:31:56,750 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 00:31:57,173 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:31:57,173 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4282 [2022-12-06 00:31:57,173 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 901 flow [2022-12-06 00:31:57,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:57,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:57,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:57,179 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 00:31:57,374 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,SelfDestructingSolverStorable43 [2022-12-06 00:31:57,374 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1427422436, now seen corresponding path program 1 times [2022-12-06 00:31:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:57,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861045114] [2022-12-06 00:31:57,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:57,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:31:57,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:57,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861045114] [2022-12-06 00:31:57,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861045114] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:31:57,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:31:57,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 00:31:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267547027] [2022-12-06 00:31:57,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:31:57,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 00:31:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:57,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 00:31:57,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 00:31:57,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 00:31:57,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 901 flow. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:57,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:57,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 00:31:57,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:57,714 INFO L130 PetriNetUnfolder]: 490/913 cut-off events. [2022-12-06 00:31:57,714 INFO L131 PetriNetUnfolder]: For 5258/5258 co-relation queries the response was YES. [2022-12-06 00:31:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 913 events. 490/913 cut-off events. For 5258/5258 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4282 event pairs, 214 based on Foata normal form. 4/916 useless extension candidates. Maximal degree in co-relation 5330. Up to 678 conditions per place. [2022-12-06 00:31:57,720 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 103 selfloop transitions, 12 changer transitions 2/117 dead transitions. [2022-12-06 00:31:57,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 117 transitions, 1472 flow [2022-12-06 00:31:57,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:31:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:31:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 59 transitions. [2022-12-06 00:31:57,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3390804597701149 [2022-12-06 00:31:57,721 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 901 flow. Second operand 6 states and 59 transitions. [2022-12-06 00:31:57,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 117 transitions, 1472 flow [2022-12-06 00:31:57,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 1372 flow, removed 50 selfloop flow, removed 0 redundant places. [2022-12-06 00:31:57,731 INFO L231 Difference]: Finished difference. Result has 91 places, 86 transitions, 919 flow [2022-12-06 00:31:57,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=91, PETRI_TRANSITIONS=86} [2022-12-06 00:31:57,731 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 70 predicate places. [2022-12-06 00:31:57,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:57,731 INFO L89 Accepts]: Start accepts. Operand has 91 places, 86 transitions, 919 flow [2022-12-06 00:31:57,732 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:57,732 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:57,732 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 86 transitions, 919 flow [2022-12-06 00:31:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 86 transitions, 919 flow [2022-12-06 00:31:57,755 INFO L130 PetriNetUnfolder]: 73/277 cut-off events. [2022-12-06 00:31:57,756 INFO L131 PetriNetUnfolder]: For 1829/1858 co-relation queries the response was YES. [2022-12-06 00:31:57,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 277 events. 73/277 cut-off events. For 1829/1858 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1525 event pairs, 9 based on Foata normal form. 2/270 useless extension candidates. Maximal degree in co-relation 1350. Up to 87 conditions per place. [2022-12-06 00:31:57,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 86 transitions, 919 flow [2022-12-06 00:31:57,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-06 00:31:57,916 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:31:57,916 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 185 [2022-12-06 00:31:57,916 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 921 flow [2022-12-06 00:31:57,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:31:57,916 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:31:57,917 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:31:57,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-06 00:31:57,917 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:31:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:31:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1903161281, now seen corresponding path program 1 times [2022-12-06 00:31:57,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:31:57,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333611418] [2022-12-06 00:31:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:31:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:57,985 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 00:31:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:31:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333611418] [2022-12-06 00:31:57,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333611418] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:31:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518547230] [2022-12-06 00:31:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:31:57,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:31:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:31:57,987 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 00:31:57,989 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 00:31:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:31:58,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:31:58,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:31:58,132 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 00:31:58,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:31:58,211 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 00:31:58,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518547230] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:31:58,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:31:58,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 00:31:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795880440] [2022-12-06 00:31:58,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:31:58,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:31:58,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:31:58,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:31:58,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:31:58,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 00:31:58,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 921 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 00:31:58,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:31:58,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 00:31:58,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:31:58,842 INFO L130 PetriNetUnfolder]: 545/1125 cut-off events. [2022-12-06 00:31:58,842 INFO L131 PetriNetUnfolder]: For 8223/8223 co-relation queries the response was YES. [2022-12-06 00:31:58,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6665 conditions, 1125 events. 545/1125 cut-off events. For 8223/8223 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6350 event pairs, 84 based on Foata normal form. 10/1135 useless extension candidates. Maximal degree in co-relation 6502. Up to 464 conditions per place. [2022-12-06 00:31:58,847 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 124 selfloop transitions, 46 changer transitions 11/181 dead transitions. [2022-12-06 00:31:58,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 181 transitions, 2205 flow [2022-12-06 00:31:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 00:31:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 00:31:58,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 00:31:58,849 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2597402597402597 [2022-12-06 00:31:58,849 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 921 flow. Second operand 11 states and 80 transitions. [2022-12-06 00:31:58,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 181 transitions, 2205 flow [2022-12-06 00:31:58,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 181 transitions, 2129 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-12-06 00:31:58,862 INFO L231 Difference]: Finished difference. Result has 100 places, 122 transitions, 1498 flow [2022-12-06 00:31:58,862 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1498, PETRI_PLACES=100, PETRI_TRANSITIONS=122} [2022-12-06 00:31:58,862 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 79 predicate places. [2022-12-06 00:31:58,862 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:31:58,863 INFO L89 Accepts]: Start accepts. Operand has 100 places, 122 transitions, 1498 flow [2022-12-06 00:31:58,863 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:31:58,863 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:31:58,863 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 122 transitions, 1498 flow [2022-12-06 00:31:58,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 122 transitions, 1498 flow [2022-12-06 00:31:58,905 INFO L130 PetriNetUnfolder]: 110/448 cut-off events. [2022-12-06 00:31:58,905 INFO L131 PetriNetUnfolder]: For 3933/3941 co-relation queries the response was YES. [2022-12-06 00:31:58,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 448 events. 110/448 cut-off events. For 3933/3941 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2972 event pairs, 5 based on Foata normal form. 2/447 useless extension candidates. Maximal degree in co-relation 2394. Up to 128 conditions per place. [2022-12-06 00:31:58,908 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 122 transitions, 1498 flow [2022-12-06 00:31:58,908 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 00:31:58,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [828] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_520| v_~f~0.base_380))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_376 (* v_~x1~0_701 4)))) (.cse2 (mod (* 3 v_~n~0_367) 4294967296))) (and (= (select .cse0 (+ v_~f~0.offset_376 (* .cse1 4))) v_~x1~0_699) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_378| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_394|) (= (ite (and (< .cse1 v_~size~0_377) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_378|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_394| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_501| 4294967296) .cse2) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_501| 1) 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_499| (+ |v_thread1Thread1of1ForFork0_~i~0#1_501| 2)) (not (= (ite (and (<= 0 v_~x1~0_701) (< v_~x1~0_701 v_~size~0_377)) 1 0) 0))))) InVars {~size~0=v_~size~0_377, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_501|, #memory_int=|v_#memory_int_520|, ~n~0=v_~n~0_367, ~x1~0=v_~x1~0_701, ~f~0.offset=v_~f~0.offset_376} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_386|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_378|, ~size~0=v_~size~0_377, ~f~0.base=v_~f~0.base_380, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_499|, #memory_int=|v_#memory_int_520|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_394|, ~n~0=v_~n~0_367, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_396|, ~x1~0=v_~x1~0_699, ~f~0.offset=v_~f~0.offset_376} 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 00:31:59,220 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 00:31:59,327 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 [830] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_522| v_~f~0.base_382))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_378 (* v_~x1~0_707 4)))) (.cse2 (mod (* 3 v_~n~0_369) 4294967296))) (and (= v_~x1~0_705 (select .cse0 (+ v_~f~0.offset_378 (* .cse1 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_382| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_398|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_398| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_507| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_505| (+ |v_thread1Thread1of1ForFork0_~i~0#1_507| 2)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_379)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_382|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_507| 1) 4294967296) .cse2) (not (= (ite (and (< v_~x1~0_707 v_~size~0_379) (<= 0 v_~x1~0_707)) 1 0) 0))))) InVars {~size~0=v_~size~0_379, ~f~0.base=v_~f~0.base_382, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_507|, #memory_int=|v_#memory_int_522|, ~n~0=v_~n~0_369, ~x1~0=v_~x1~0_707, ~f~0.offset=v_~f~0.offset_378} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_390|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_382|, ~size~0=v_~size~0_379, ~f~0.base=v_~f~0.base_382, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_505|, #memory_int=|v_#memory_int_522|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_398|, ~n~0=v_~n~0_369, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_400|, ~x1~0=v_~x1~0_705, ~f~0.offset=v_~f~0.offset_378} 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 00:31:59,489 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 00:31:59,605 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 [820] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_500| v_~f~0.base_366))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_677 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_365)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x1~0_675) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382| 0)) (not (= (ite (and (<= 0 v_~x1~0_677) (< v_~x1~0_677 v_~size~0_365)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_483| 4294967295) 4294967296) (mod (* 3 v_~n~0_355) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_365)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|))))) InVars {~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, #memory_int=|v_#memory_int_500|, ~n~0=v_~n~0_355, ~x1~0=v_~x1~0_677, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_374|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|, ~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|, ~n~0=v_~n~0_355, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|, ~x1~0=v_~x1~0_675, ~f~0.offset=v_~f~0.offset_362} 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 00:31:59,775 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 00:31:59,872 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 00:31:59,968 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 00:32:00,062 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 00:32:00,155 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 00:32:00,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 00:32:00,367 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 00:32:00,466 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 00:32:00,564 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 00:32:00,676 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 00:32:00,799 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 00:32:00,900 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 00:32:00,996 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 00:32:01,089 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 00:32:01,185 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 00:32:01,280 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 00:32:01,380 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 00:32:01,498 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 [820] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_500| v_~f~0.base_366))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_362 (* v_~x1~0_677 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_362 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_365)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_362 (* .cse2 4))) v_~x1~0_675) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382| 0)) (not (= (ite (and (<= 0 v_~x1~0_677) (< v_~x1~0_677 v_~size~0_365)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_483| 3) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_483| 4294967295) 4294967296) (mod (* 3 v_~n~0_355) 4294967296)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|) (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_365)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|))))) InVars {~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, #memory_int=|v_#memory_int_500|, ~n~0=v_~n~0_355, ~x1~0=v_~x1~0_677, ~f~0.offset=v_~f~0.offset_362} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_374|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_366|, ~size~0=v_~size~0_365, ~f~0.base=v_~f~0.base_366, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_483|, #memory_int=|v_#memory_int_500|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_382|, ~n~0=v_~n~0_355, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_384|, ~x1~0=v_~x1~0_675, ~f~0.offset=v_~f~0.offset_362} 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 00:32:01,639 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 00:32:01,744 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 00:32:01,865 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 00:32:01,984 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 00:32:02,084 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 00:32:02,177 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 00:32:02,535 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 00:32:02,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3673 [2022-12-06 00:32:02,535 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 121 transitions, 1919 flow [2022-12-06 00:32:02,536 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 00:32:02,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:02,536 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:02,544 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 00:32:02,736 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 00:32:02,736 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:02,737 INFO L85 PathProgramCache]: Analyzing trace with hash -446704952, now seen corresponding path program 1 times [2022-12-06 00:32:02,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:02,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766739014] [2022-12-06 00:32:02,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:02,810 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 00:32:02,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:02,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766739014] [2022-12-06 00:32:02,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766739014] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:02,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468468375] [2022-12-06 00:32:02,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:02,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:02,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:02,812 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 00:32:02,814 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 00:32:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:02,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 00:32:02,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:32:02,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:32:02,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468468375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:02,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:02,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-12-06 00:32:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331429989] [2022-12-06 00:32:02,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:02,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:32:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:02,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:32:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:32:02,999 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 55 [2022-12-06 00:32:03,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 121 transitions, 1919 flow. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:03,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:03,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 55 [2022-12-06 00:32:03,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:03,463 INFO L130 PetriNetUnfolder]: 551/1128 cut-off events. [2022-12-06 00:32:03,463 INFO L131 PetriNetUnfolder]: For 12929/12929 co-relation queries the response was YES. [2022-12-06 00:32:03,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7979 conditions, 1128 events. 551/1128 cut-off events. For 12929/12929 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6288 event pairs, 257 based on Foata normal form. 12/1140 useless extension candidates. Maximal degree in co-relation 7802. Up to 1099 conditions per place. [2022-12-06 00:32:03,469 INFO L137 encePairwiseOnDemand]: 45/55 looper letters, 120 selfloop transitions, 15 changer transitions 2/137 dead transitions. [2022-12-06 00:32:03,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 137 transitions, 2381 flow [2022-12-06 00:32:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 00:32:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 00:32:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-06 00:32:03,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23030303030303031 [2022-12-06 00:32:03,470 INFO L175 Difference]: Start difference. First operand has 96 places, 121 transitions, 1919 flow. Second operand 6 states and 76 transitions. [2022-12-06 00:32:03,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 137 transitions, 2381 flow [2022-12-06 00:32:03,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 137 transitions, 2243 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-12-06 00:32:03,494 INFO L231 Difference]: Finished difference. Result has 101 places, 127 transitions, 1962 flow [2022-12-06 00:32:03,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1781, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1962, PETRI_PLACES=101, PETRI_TRANSITIONS=127} [2022-12-06 00:32:03,495 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 80 predicate places. [2022-12-06 00:32:03,495 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:03,495 INFO L89 Accepts]: Start accepts. Operand has 101 places, 127 transitions, 1962 flow [2022-12-06 00:32:03,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:03,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:03,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 127 transitions, 1962 flow [2022-12-06 00:32:03,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 127 transitions, 1962 flow [2022-12-06 00:32:03,544 INFO L130 PetriNetUnfolder]: 114/456 cut-off events. [2022-12-06 00:32:03,544 INFO L131 PetriNetUnfolder]: For 5399/5414 co-relation queries the response was YES. [2022-12-06 00:32:03,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 456 events. 114/456 cut-off events. For 5399/5414 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3072 event pairs, 5 based on Foata normal form. 2/454 useless extension candidates. Maximal degree in co-relation 2775. Up to 126 conditions per place. [2022-12-06 00:32:03,548 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 127 transitions, 1962 flow [2022-12-06 00:32:03,548 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 00:32:04,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [825] L49-2-->L49-2: Formula: (let ((.cse0 (select |v_#memory_int_516| v_~f~0.base_376))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_372 (* v_~x1~0_691 4))))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_372 (* 4 .cse3)))) (.cse2 (mod (* 3 v_~n~0_363) 4294967296))) (and (= |v_thread1Thread1of1ForFork0_~i~0#1_489| (+ |v_thread1Thread1of1ForFork0_~i~0#1_491| 3)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_372)) v_~x1~0_689) (not (= (ite (and (<= 0 v_~x1~0_691) (< v_~x1~0_691 v_~size~0_373)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_491| 1) 4294967296) .cse2) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_373)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_491| 4294967296) .cse2) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_373)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_491| 2) 4294967296) .cse2))))) InVars {~size~0=v_~size~0_373, ~f~0.base=v_~f~0.base_376, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_491|, #memory_int=|v_#memory_int_516|, ~n~0=v_~n~0_363, ~x1~0=v_~x1~0_691, ~f~0.offset=v_~f~0.offset_372} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_380|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_372|, ~size~0=v_~size~0_373, ~f~0.base=v_~f~0.base_376, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_489|, #memory_int=|v_#memory_int_516|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_388|, ~n~0=v_~n~0_363, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_390|, ~x1~0=v_~x1~0_689, ~f~0.offset=v_~f~0.offset_372} 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 00:32:04,793 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:32:04,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1299 [2022-12-06 00:32:04,794 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 127 transitions, 1976 flow [2022-12-06 00:32:04,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:04,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:04,794 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:04,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-06 00:32:05,001 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 00:32:05,002 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash -27900604, now seen corresponding path program 1 times [2022-12-06 00:32:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:05,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744426666] [2022-12-06 00:32:05,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:05,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744426666] [2022-12-06 00:32:05,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744426666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:05,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344172641] [2022-12-06 00:32:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:05,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:05,057 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 00:32:05,059 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 00:32:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:05,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:32:05,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:05,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:05,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344172641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:05,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:05,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 00:32:05,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690117705] [2022-12-06 00:32:05,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:05,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 00:32:05,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:05,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 00:32:05,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 00:32:05,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 00:32:05,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 127 transitions, 1976 flow. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:05,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:05,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 00:32:05,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:05,691 INFO L130 PetriNetUnfolder]: 561/1136 cut-off events. [2022-12-06 00:32:05,692 INFO L131 PetriNetUnfolder]: For 15795/15795 co-relation queries the response was YES. [2022-12-06 00:32:05,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8362 conditions, 1136 events. 561/1136 cut-off events. For 15795/15795 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6305 event pairs, 255 based on Foata normal form. 8/1142 useless extension candidates. Maximal degree in co-relation 8183. Up to 1073 conditions per place. [2022-12-06 00:32:05,698 INFO L137 encePairwiseOnDemand]: 42/56 looper letters, 113 selfloop transitions, 28 changer transitions 4/145 dead transitions. [2022-12-06 00:32:05,698 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 145 transitions, 2557 flow [2022-12-06 00:32:05,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:32:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:32:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 85 transitions. [2022-12-06 00:32:05,699 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.18973214285714285 [2022-12-06 00:32:05,699 INFO L175 Difference]: Start difference. First operand has 100 places, 127 transitions, 1976 flow. Second operand 8 states and 85 transitions. [2022-12-06 00:32:05,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 145 transitions, 2557 flow [2022-12-06 00:32:05,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 145 transitions, 2406 flow, removed 71 selfloop flow, removed 3 redundant places. [2022-12-06 00:32:05,728 INFO L231 Difference]: Finished difference. Result has 107 places, 132 transitions, 2063 flow [2022-12-06 00:32:05,729 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2063, PETRI_PLACES=107, PETRI_TRANSITIONS=132} [2022-12-06 00:32:05,729 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 86 predicate places. [2022-12-06 00:32:05,729 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:05,729 INFO L89 Accepts]: Start accepts. Operand has 107 places, 132 transitions, 2063 flow [2022-12-06 00:32:05,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:05,730 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:05,730 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 132 transitions, 2063 flow [2022-12-06 00:32:05,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 132 transitions, 2063 flow [2022-12-06 00:32:05,769 INFO L130 PetriNetUnfolder]: 119/455 cut-off events. [2022-12-06 00:32:05,769 INFO L131 PetriNetUnfolder]: For 6056/6072 co-relation queries the response was YES. [2022-12-06 00:32:05,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3001 conditions, 455 events. 119/455 cut-off events. For 6056/6072 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3011 event pairs, 5 based on Foata normal form. 3/454 useless extension candidates. Maximal degree in co-relation 2892. Up to 128 conditions per place. [2022-12-06 00:32:05,773 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 132 transitions, 2063 flow [2022-12-06 00:32:05,773 INFO L188 LiptonReduction]: Number of co-enabled transitions 352 [2022-12-06 00:32:08,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_586| v_~f~0.base_446))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_442 (* v_~x2~0_584 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_442 (* v_~x1~0_843 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_442 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_442 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_433) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 1) 4294967296) .cse0) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_464|) |v_thread2Thread1of1ForFork1_~i~1#1_463|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 2) 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse2 4))) v_~x1~0_842) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|) (= (ite (and (< .cse2 v_~size~0_443) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|) (not (= (ite (and (< v_~x1~0_843 v_~size~0_443) (<= 0 v_~x1~0_843)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_636| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x2~0_584) (< v_~x2~0_584 v_~size~0_443)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|) (not (= (ite (and (< .cse3 v_~size~0_443) (<= 0 .cse3)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse4 4))) v_~x2~0_583) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_443)) 1 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_443)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_464| 4294967296) .cse0))))) InVars {~x2~0=v_~x2~0_584, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_636|, #memory_int=|v_#memory_int_586|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_464|, ~n~0=v_~n~0_433, ~x1~0=v_~x1~0_843, ~f~0.offset=v_~f~0.offset_442} OutVars{~x2~0=v_~x2~0_583, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_463|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_322|, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_294|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_463|, ~x1~0=v_~x1~0_842, ~f~0.offset=v_~f~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_286|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_284|, #memory_int=|v_#memory_int_586|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_294|, ~n~0=v_~n~0_433, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_298|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_473|} 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 00:32:09,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [863] L49-2-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_586| v_~f~0.base_446))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_442 (* v_~x2~0_584 4)))) (.cse5 (select .cse1 (+ v_~f~0.offset_442 (* v_~x1~0_843 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_442 (* .cse5 4)))) (.cse4 (select .cse1 (+ v_~f~0.offset_442 (* .cse3 4)))) (.cse0 (mod (* 3 v_~n~0_433) 4294967296))) (and (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 1) 4294967296) .cse0) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_464|) |v_thread2Thread1of1ForFork1_~i~1#1_463|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 2) 4294967296) .cse0) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse2 4))) v_~x1~0_842) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|) (= (ite (and (< .cse2 v_~size~0_443) (<= 0 .cse2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|) (not (= (ite (and (< v_~x1~0_843 v_~size~0_443) (<= 0 v_~x1~0_843)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_636| 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x2~0_584) (< v_~x2~0_584 v_~size~0_443)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_635| (+ |v_thread1Thread1of1ForFork0_~i~0#1_636| 3)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|) (not (= (ite (and (< .cse3 v_~size~0_443) (<= 0 .cse3)) 1 0) 0)) (= (select .cse1 (+ v_~f~0.offset_442 (* .cse4 4))) v_~x2~0_583) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330| (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_443)) 1 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_443)) 1 0) 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_464| 4294967296) .cse0))))) InVars {~x2~0=v_~x2~0_584, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_636|, #memory_int=|v_#memory_int_586|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_464|, ~n~0=v_~n~0_433, ~x1~0=v_~x1~0_843, ~f~0.offset=v_~f~0.offset_442} OutVars{~x2~0=v_~x2~0_583, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_463|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_322|, ~size~0=v_~size~0_443, ~f~0.base=v_~f~0.base_446, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_294|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_330|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_463|, ~x1~0=v_~x1~0_842, ~f~0.offset=v_~f~0.offset_442, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_362|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_455|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_286|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_635|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_284|, #memory_int=|v_#memory_int_586|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_471|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_294|, ~n~0=v_~n~0_433, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_298|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_473|} 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 00:32:10,833 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [831] L49-2-->L59-2: Formula: (let ((.cse0 (select |v_#memory_int_524| v_~f~0.base_384))) (let ((.cse4 (select .cse0 (+ v_~f~0.offset_380 (* v_~x2~0_575 4))))) (let ((.cse3 (select .cse0 (+ v_~f~0.offset_380 (* .cse4 4)))) (.cse2 (mod (* 3 v_~n~0_371) 4294967296)) (.cse1 (select .cse0 (+ v_~f~0.offset_380 (* v_~x1~0_714 4))))) (and (= v_~x1~0_713 (select .cse0 (+ v_~f~0.offset_380 (* .cse1 4)))) (not (= (ite (and (<= 0 v_~x1~0_714) (< v_~x1~0_714 v_~size~0_381)) 1 0) 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_515| 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_325| (ite (and (< .cse3 v_~size~0_381) (<= 0 .cse3)) 1 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_515| 1) 4294967296) .cse2) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_325| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_357|) (not (= (ite (and (< .cse4 v_~size~0_381) (<= 0 .cse4)) 1 0) 0)) (= (select .cse0 (+ (* .cse3 4) v_~f~0.offset_380)) v_~x2~0_574) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_404|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_357| 0)) (= |v_thread2Thread1of1ForFork1_~i~1#1_400| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_401|)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_401| 4294967296) .cse2) (= |v_thread1Thread1of1ForFork0_~i~0#1_514| (+ |v_thread1Thread1of1ForFork0_~i~0#1_515| 2)) (= (ite (and (< .cse1 v_~size~0_381) (<= 0 .cse1)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_404| 0)) (not (= 0 (ite (and (< v_~x2~0_575 v_~size~0_381) (<= 0 v_~x2~0_575)) 1 0))))))) InVars {~x2~0=v_~x2~0_575, ~size~0=v_~size~0_381, ~f~0.base=v_~f~0.base_384, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_515|, #memory_int=|v_#memory_int_524|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_401|, ~n~0=v_~n~0_371, ~x1~0=v_~x1~0_714, ~f~0.offset=v_~f~0.offset_380} OutVars{~x2~0=v_~x2~0_574, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_396|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_317|, ~size~0=v_~size~0_381, ~f~0.base=v_~f~0.base_384, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_289|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_325|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_400|, ~x1~0=v_~x1~0_713, ~f~0.offset=v_~f~0.offset_380, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_357|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_388|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_281|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_514|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_279|, #memory_int=|v_#memory_int_524|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_404|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_289|, ~n~0=v_~n~0_371, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_293|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_406|} 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 00:32:12,115 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 00:32:12,207 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 00:32:12,301 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 00:32:13,130 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 00:32:13,131 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7402 [2022-12-06 00:32:13,131 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 132 transitions, 2148 flow [2022-12-06 00:32:13,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:13,131 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:13,131 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:13,138 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 00:32:13,332 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 00:32:13,332 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 236684596, now seen corresponding path program 1 times [2022-12-06 00:32:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:13,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978746904] [2022-12-06 00:32:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:13,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978746904] [2022-12-06 00:32:13,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978746904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:13,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080970103] [2022-12-06 00:32:13,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:13,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:13,552 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 00:32:13,554 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 00:32:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:13,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 00:32:13,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:13,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:13,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080970103] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:13,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:13,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-12-06 00:32:13,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881318447] [2022-12-06 00:32:13,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:13,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:32:13,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:13,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:32:13,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:32:13,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 00:32:13,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 132 transitions, 2148 flow. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:13,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:13,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 00:32:13,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:16,700 INFO L130 PetriNetUnfolder]: 620/1255 cut-off events. [2022-12-06 00:32:16,700 INFO L131 PetriNetUnfolder]: For 17541/17541 co-relation queries the response was YES. [2022-12-06 00:32:16,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9343 conditions, 1255 events. 620/1255 cut-off events. For 17541/17541 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7169 event pairs, 227 based on Foata normal form. 8/1261 useless extension candidates. Maximal degree in co-relation 9169. Up to 931 conditions per place. [2022-12-06 00:32:16,709 INFO L137 encePairwiseOnDemand]: 27/65 looper letters, 98 selfloop transitions, 65 changer transitions 10/173 dead transitions. [2022-12-06 00:32:16,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 173 transitions, 3070 flow [2022-12-06 00:32:16,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:32:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:32:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2022-12-06 00:32:16,710 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1794871794871795 [2022-12-06 00:32:16,710 INFO L175 Difference]: Start difference. First operand has 106 places, 132 transitions, 2148 flow. Second operand 9 states and 105 transitions. [2022-12-06 00:32:16,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 173 transitions, 3070 flow [2022-12-06 00:32:16,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 173 transitions, 2918 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-12-06 00:32:16,744 INFO L231 Difference]: Finished difference. Result has 114 places, 136 transitions, 2325 flow [2022-12-06 00:32:16,744 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2325, PETRI_PLACES=114, PETRI_TRANSITIONS=136} [2022-12-06 00:32:16,745 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 93 predicate places. [2022-12-06 00:32:16,745 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:16,745 INFO L89 Accepts]: Start accepts. Operand has 114 places, 136 transitions, 2325 flow [2022-12-06 00:32:16,745 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:16,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:16,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 136 transitions, 2325 flow [2022-12-06 00:32:16,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 136 transitions, 2325 flow [2022-12-06 00:32:16,790 INFO L130 PetriNetUnfolder]: 131/503 cut-off events. [2022-12-06 00:32:16,790 INFO L131 PetriNetUnfolder]: For 6629/6644 co-relation queries the response was YES. [2022-12-06 00:32:16,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3404 conditions, 503 events. 131/503 cut-off events. For 6629/6644 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3449 event pairs, 7 based on Foata normal form. 2/501 useless extension candidates. Maximal degree in co-relation 3289. Up to 149 conditions per place. [2022-12-06 00:32:16,794 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 136 transitions, 2325 flow [2022-12-06 00:32:16,794 INFO L188 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-06 00:32:16,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:32:16,795 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 00:32:16,795 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 136 transitions, 2325 flow [2022-12-06 00:32:16,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:16,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:16,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:16,810 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 00:32:16,995 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 00:32:16,996 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:16,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash 821799550, now seen corresponding path program 1 times [2022-12-06 00:32:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:16,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660280060] [2022-12-06 00:32:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:16,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:18,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:18,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660280060] [2022-12-06 00:32:18,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660280060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:18,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43073956] [2022-12-06 00:32:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:18,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:18,335 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 00:32:18,335 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 00:32:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:18,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 00:32:18,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:18,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:18,483 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 00:32:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:18,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:18,642 INFO L321 Elim1Store]: treesize reduction 15, result has 90.4 percent of original size [2022-12-06 00:32:18,642 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 51 treesize of output 177 [2022-12-06 00:32:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:18,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43073956] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:18,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:18,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 2] total 7 [2022-12-06 00:32:18,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038260392] [2022-12-06 00:32:18,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:18,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:32:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:18,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:32:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:32:18,838 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 00:32:18,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 136 transitions, 2325 flow. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:18,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:18,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 00:32:18,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:19,433 INFO L130 PetriNetUnfolder]: 637/1265 cut-off events. [2022-12-06 00:32:19,434 INFO L131 PetriNetUnfolder]: For 16714/16714 co-relation queries the response was YES. [2022-12-06 00:32:19,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9573 conditions, 1265 events. 637/1265 cut-off events. For 16714/16714 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7051 event pairs, 99 based on Foata normal form. 1/1264 useless extension candidates. Maximal degree in co-relation 9288. Up to 1223 conditions per place. [2022-12-06 00:32:19,440 INFO L137 encePairwiseOnDemand]: 42/62 looper letters, 126 selfloop transitions, 31 changer transitions 5/162 dead transitions. [2022-12-06 00:32:19,440 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 162 transitions, 2961 flow [2022-12-06 00:32:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 00:32:19,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 00:32:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2022-12-06 00:32:19,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21428571428571427 [2022-12-06 00:32:19,441 INFO L175 Difference]: Start difference. First operand has 110 places, 136 transitions, 2325 flow. Second operand 7 states and 93 transitions. [2022-12-06 00:32:19,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 162 transitions, 2961 flow [2022-12-06 00:32:19,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 2877 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-12-06 00:32:19,472 INFO L231 Difference]: Finished difference. Result has 113 places, 149 transitions, 2588 flow [2022-12-06 00:32:19,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2588, PETRI_PLACES=113, PETRI_TRANSITIONS=149} [2022-12-06 00:32:19,472 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2022-12-06 00:32:19,472 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:19,472 INFO L89 Accepts]: Start accepts. Operand has 113 places, 149 transitions, 2588 flow [2022-12-06 00:32:19,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:19,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:19,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 149 transitions, 2588 flow [2022-12-06 00:32:19,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 149 transitions, 2588 flow [2022-12-06 00:32:19,519 INFO L130 PetriNetUnfolder]: 141/505 cut-off events. [2022-12-06 00:32:19,519 INFO L131 PetriNetUnfolder]: For 6438/6453 co-relation queries the response was YES. [2022-12-06 00:32:19,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 505 events. 141/505 cut-off events. For 6438/6453 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3359 event pairs, 7 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 3323. Up to 152 conditions per place. [2022-12-06 00:32:19,523 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 149 transitions, 2588 flow [2022-12-06 00:32:19,523 INFO L188 LiptonReduction]: Number of co-enabled transitions 386 [2022-12-06 00:32:19,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [862] L49-2-->L49-2: Formula: (let ((.cse2 (select |v_#memory_int_584| v_~f~0.base_444))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_440 (* v_~x1~0_838 4))))) (let ((.cse4 (select .cse2 (+ v_~f~0.offset_440 (* .cse1 4))))) (let ((.cse3 (select .cse2 (+ v_~f~0.offset_440 (* .cse4 4)))) (.cse0 (mod (* 3 v_~n~0_431) 4294967296))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467|) (= |v_thread1Thread1of1ForFork0_~i~0#1_629| (+ |v_thread1Thread1of1ForFork0_~i~0#1_631| 4)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_629| 4294967295) 4294967296) .cse0) (not (= (ite (and (< .cse1 v_~size~0_441) (<= 0 .cse1)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_631| 2) 4294967296) .cse0) (not (= (ite (and (<= 0 v_~x1~0_838) (< v_~x1~0_838 v_~size~0_441)) 1 0) 0)) (= v_~x1~0_836 (select .cse2 (+ v_~f~0.offset_440 (* .cse3 4)))) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_631| 4294967296) .cse0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467| 0)) (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_441)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_441)) 1 0) 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_631| 1) 4294967296) .cse0)))))) InVars {~size~0=v_~size~0_441, ~f~0.base=v_~f~0.base_444, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_631|, #memory_int=|v_#memory_int_584|, ~n~0=v_~n~0_431, ~x1~0=v_~x1~0_838, ~f~0.offset=v_~f~0.offset_440} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_459|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_451|, ~size~0=v_~size~0_441, ~f~0.base=v_~f~0.base_444, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_629|, #memory_int=|v_#memory_int_584|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_467|, ~n~0=v_~n~0_431, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_469|, ~x1~0=v_~x1~0_836, ~f~0.offset=v_~f~0.offset_440} 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 00:32:20,426 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:32:20,427 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 955 [2022-12-06 00:32:20,427 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 149 transitions, 2595 flow [2022-12-06 00:32:20,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:20,427 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:20,427 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:20,434 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 00:32:20,627 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 00:32:20,628 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1380104443, now seen corresponding path program 1 times [2022-12-06 00:32:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423619436] [2022-12-06 00:32:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:20,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 00:32:20,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423619436] [2022-12-06 00:32:20,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423619436] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:20,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450617778] [2022-12-06 00:32:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:20,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:20,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:20,684 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 00:32:20,685 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 00:32:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:20,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:32:20,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:20,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:20,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:20,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450617778] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:20,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:20,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-06 00:32:20,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410295474] [2022-12-06 00:32:20,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:20,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:32:20,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:32:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:32:20,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 00:32:20,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 149 transitions, 2595 flow. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:20,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:20,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 00:32:20,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:21,724 INFO L130 PetriNetUnfolder]: 679/1335 cut-off events. [2022-12-06 00:32:21,725 INFO L131 PetriNetUnfolder]: For 17904/17904 co-relation queries the response was YES. [2022-12-06 00:32:21,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10349 conditions, 1335 events. 679/1335 cut-off events. For 17904/17904 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7469 event pairs, 281 based on Foata normal form. 14/1347 useless extension candidates. Maximal degree in co-relation 9944. Up to 1196 conditions per place. [2022-12-06 00:32:21,732 INFO L137 encePairwiseOnDemand]: 40/63 looper letters, 126 selfloop transitions, 53 changer transitions 8/187 dead transitions. [2022-12-06 00:32:21,732 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 187 transitions, 3612 flow [2022-12-06 00:32:21,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 00:32:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 00:32:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2022-12-06 00:32:21,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.14814814814814814 [2022-12-06 00:32:21,734 INFO L175 Difference]: Start difference. First operand has 113 places, 149 transitions, 2595 flow. Second operand 12 states and 112 transitions. [2022-12-06 00:32:21,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 187 transitions, 3612 flow [2022-12-06 00:32:21,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 187 transitions, 3528 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 00:32:21,774 INFO L231 Difference]: Finished difference. Result has 128 places, 164 transitions, 3059 flow [2022-12-06 00:32:21,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2511, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3059, PETRI_PLACES=128, PETRI_TRANSITIONS=164} [2022-12-06 00:32:21,774 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 107 predicate places. [2022-12-06 00:32:21,774 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:21,774 INFO L89 Accepts]: Start accepts. Operand has 128 places, 164 transitions, 3059 flow [2022-12-06 00:32:21,775 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:21,775 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:21,775 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 164 transitions, 3059 flow [2022-12-06 00:32:21,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 164 transitions, 3059 flow [2022-12-06 00:32:21,845 INFO L130 PetriNetUnfolder]: 153/539 cut-off events. [2022-12-06 00:32:21,845 INFO L131 PetriNetUnfolder]: For 9420/9435 co-relation queries the response was YES. [2022-12-06 00:32:21,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4197 conditions, 539 events. 153/539 cut-off events. For 9420/9435 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3630 event pairs, 7 based on Foata normal form. 2/536 useless extension candidates. Maximal degree in co-relation 3978. Up to 170 conditions per place. [2022-12-06 00:32:21,849 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 164 transitions, 3059 flow [2022-12-06 00:32:21,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 00:32:21,850 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:32:21,850 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-06 00:32:21,850 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 164 transitions, 3059 flow [2022-12-06 00:32:21,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:21,851 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:21,851 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:21,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-12-06 00:32:22,051 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 00:32:22,051 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:22,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1229310820, now seen corresponding path program 1 times [2022-12-06 00:32:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662658048] [2022-12-06 00:32:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:26,375 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 00:32:26,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:26,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662658048] [2022-12-06 00:32:26,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662658048] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:26,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012806166] [2022-12-06 00:32:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:26,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:26,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:26,378 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 00:32:26,378 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 00:32:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:26,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-06 00:32:26,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:26,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 00:32:26,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 11 new quantified variables, introduced 15 case distinctions, treesize of input 75 treesize of output 152 [2022-12-06 00:32:26,932 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 00:32:26,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:28,534 INFO L321 Elim1Store]: treesize reduction 30, result has 95.1 percent of original size [2022-12-06 00:32:28,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 22 new quantified variables, introduced 66 case distinctions, treesize of input 99 treesize of output 666 [2022-12-06 00:32:40,163 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 00:32:40,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012806166] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:40,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:40,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 00:32:40,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074647039] [2022-12-06 00:32:40,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:40,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 00:32:40,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:40,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 00:32:40,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-06 00:32:40,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 00:32:40,165 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 164 transitions, 3059 flow. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:40,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:40,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 00:32:40,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:42,625 INFO L130 PetriNetUnfolder]: 717/1409 cut-off events. [2022-12-06 00:32:42,625 INFO L131 PetriNetUnfolder]: For 25609/25609 co-relation queries the response was YES. [2022-12-06 00:32:42,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11986 conditions, 1409 events. 717/1409 cut-off events. For 25609/25609 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8043 event pairs, 100 based on Foata normal form. 2/1407 useless extension candidates. Maximal degree in co-relation 11209. Up to 1298 conditions per place. [2022-12-06 00:32:42,634 INFO L137 encePairwiseOnDemand]: 40/63 looper letters, 147 selfloop transitions, 46 changer transitions 7/200 dead transitions. [2022-12-06 00:32:42,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 200 transitions, 4002 flow [2022-12-06 00:32:42,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 00:32:42,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 00:32:42,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2022-12-06 00:32:42,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.17777777777777778 [2022-12-06 00:32:42,636 INFO L175 Difference]: Start difference. First operand has 128 places, 164 transitions, 3059 flow. Second operand 10 states and 112 transitions. [2022-12-06 00:32:42,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 200 transitions, 4002 flow [2022-12-06 00:32:42,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 200 transitions, 3740 flow, removed 104 selfloop flow, removed 3 redundant places. [2022-12-06 00:32:42,696 INFO L231 Difference]: Finished difference. Result has 135 places, 179 transitions, 3272 flow [2022-12-06 00:32:42,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3272, PETRI_PLACES=135, PETRI_TRANSITIONS=179} [2022-12-06 00:32:42,696 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2022-12-06 00:32:42,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:42,696 INFO L89 Accepts]: Start accepts. Operand has 135 places, 179 transitions, 3272 flow [2022-12-06 00:32:42,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:42,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:42,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 179 transitions, 3272 flow [2022-12-06 00:32:42,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 179 transitions, 3272 flow [2022-12-06 00:32:42,762 INFO L130 PetriNetUnfolder]: 163/567 cut-off events. [2022-12-06 00:32:42,762 INFO L131 PetriNetUnfolder]: For 10078/10094 co-relation queries the response was YES. [2022-12-06 00:32:42,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4453 conditions, 567 events. 163/567 cut-off events. For 10078/10094 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3890 event pairs, 7 based on Foata normal form. 3/564 useless extension candidates. Maximal degree in co-relation 4068. Up to 175 conditions per place. [2022-12-06 00:32:42,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 179 transitions, 3272 flow [2022-12-06 00:32:42,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 452 [2022-12-06 00:32:43,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->L49-2: Formula: (let ((.cse1 (select |v_#memory_int_463| v_~f~0.base_333))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_329 (* v_~x2~0_495 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_329 (* .cse0 4))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_333)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_314| (ite (and (<= 0 v_~x1~0_595) (< v_~x1~0_595 v_~size~0_333)) 1 0)) (= v_~x1~0_594 (select .cse1 (+ v_~f~0.offset_329 (* v_~x1~0_595 4)))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_314| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330|) (= v_~x2~0_494 (select .cse1 (+ v_~f~0.offset_329 (* .cse2 4)))) (not (= (ite (and (<= 0 v_~x2~0_495) (< v_~x2~0_495 v_~size~0_333)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| (ite (and (< .cse2 v_~size~0_333) (<= 0 .cse2)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330| 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_426| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309| 0)) (< (mod (+ |v_thread1Thread1of1ForFork0_~i~0#1_426| 4294967295) 4294967296) (mod (* 3 v_~n~0_323) 4294967296)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_277| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_309|) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_346|))))) InVars {~x2~0=v_~x2~0_495, ~size~0=v_~size~0_333, ~f~0.base=v_~f~0.base_333, #memory_int=|v_#memory_int_463|, ~n~0=v_~n~0_323, ~x1~0=v_~x1~0_595, ~f~0.offset=v_~f~0.offset_329} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_322|, ~x2~0=v_~x2~0_494, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_269|, ~size~0=v_~size~0_333, ~f~0.base=v_~f~0.base_333, 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_346|, ~x1~0=v_~x1~0_594, ~f~0.offset=v_~f~0.offset_329, 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_314|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_233|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_426|, #memory_int=|v_#memory_int_463|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_330|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_231|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_241|, ~n~0=v_~n~0_323, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_332|, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_245|} 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 00:32:48,620 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 00:32:48,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5925 [2022-12-06 00:32:48,621 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 179 transitions, 3415 flow [2022-12-06 00:32:48,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:48,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:48,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:48,627 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 00:32:48,827 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 00:32:48,827 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash 973349869, now seen corresponding path program 1 times [2022-12-06 00:32:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:48,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713815716] [2022-12-06 00:32:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:49,033 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 00:32:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713815716] [2022-12-06 00:32:49,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713815716] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049505815] [2022-12-06 00:32:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:49,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:49,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:49,048 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:32:49,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-06 00:32:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:49,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 00:32:49,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:49,373 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 00:32:49,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:49,592 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 00:32:49,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049505815] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:49,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:49,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 00:32:49,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868244533] [2022-12-06 00:32:49,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:49,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 00:32:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 00:32:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-12-06 00:32:49,593 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 00:32:49,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 179 transitions, 3415 flow. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:49,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:49,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 00:32:49,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:32:54,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 00:32:55,458 INFO L130 PetriNetUnfolder]: 791/1615 cut-off events. [2022-12-06 00:32:55,459 INFO L131 PetriNetUnfolder]: For 30553/30553 co-relation queries the response was YES. [2022-12-06 00:32:55,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13564 conditions, 1615 events. 791/1615 cut-off events. For 30553/30553 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9906 event pairs, 74 based on Foata normal form. 20/1631 useless extension candidates. Maximal degree in co-relation 11977. Up to 496 conditions per place. [2022-12-06 00:32:55,498 INFO L137 encePairwiseOnDemand]: 12/69 looper letters, 113 selfloop transitions, 152 changer transitions 6/271 dead transitions. [2022-12-06 00:32:55,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 271 transitions, 5193 flow [2022-12-06 00:32:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:32:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:32:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 139 transitions. [2022-12-06 00:32:55,499 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12590579710144928 [2022-12-06 00:32:55,500 INFO L175 Difference]: Start difference. First operand has 135 places, 179 transitions, 3415 flow. Second operand 16 states and 139 transitions. [2022-12-06 00:32:55,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 271 transitions, 5193 flow [2022-12-06 00:32:55,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 271 transitions, 4999 flow, removed 83 selfloop flow, removed 4 redundant places. [2022-12-06 00:32:55,590 INFO L231 Difference]: Finished difference. Result has 147 places, 217 transitions, 4272 flow [2022-12-06 00:32:55,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3249, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4272, PETRI_PLACES=147, PETRI_TRANSITIONS=217} [2022-12-06 00:32:55,590 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 126 predicate places. [2022-12-06 00:32:55,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:32:55,591 INFO L89 Accepts]: Start accepts. Operand has 147 places, 217 transitions, 4272 flow [2022-12-06 00:32:55,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:32:55,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:32:55,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 217 transitions, 4272 flow [2022-12-06 00:32:55,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 217 transitions, 4272 flow [2022-12-06 00:32:55,701 INFO L130 PetriNetUnfolder]: 188/662 cut-off events. [2022-12-06 00:32:55,702 INFO L131 PetriNetUnfolder]: For 11990/12003 co-relation queries the response was YES. [2022-12-06 00:32:55,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 662 events. 188/662 cut-off events. For 11990/12003 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4759 event pairs, 6 based on Foata normal form. 0/657 useless extension candidates. Maximal degree in co-relation 4693. Up to 207 conditions per place. [2022-12-06 00:32:55,709 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 217 transitions, 4272 flow [2022-12-06 00:32:55,709 INFO L188 LiptonReduction]: Number of co-enabled transitions 534 [2022-12-06 00:32:55,711 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:32:55,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 121 [2022-12-06 00:32:55,711 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 217 transitions, 4272 flow [2022-12-06 00:32:55,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:32:55,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:32:55,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:32:55,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-06 00:32:55,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:55,917 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:32:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:32:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash 709827820, now seen corresponding path program 1 times [2022-12-06 00:32:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:32:55,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787160462] [2022-12-06 00:32:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:32:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:56,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:32:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787160462] [2022-12-06 00:32:56,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787160462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:32:56,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238594826] [2022-12-06 00:32:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:32:56,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:32:56,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:32:56,123 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:32:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-06 00:32:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:32:56,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 00:32:56,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:32:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:56,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:32:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:32:56,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238594826] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:32:56,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:32:56,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-06 00:32:56,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522627895] [2022-12-06 00:32:56,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:32:56,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 00:32:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:32:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 00:32:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-06 00:32:56,366 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 69 [2022-12-06 00:32:56,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 217 transitions, 4272 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 00:32:56,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:32:56,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 69 [2022-12-06 00:32:56,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:33:02,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:33:04,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:33:07,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:33:09,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:33:11,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 00:33:13,008 INFO L130 PetriNetUnfolder]: 915/1835 cut-off events. [2022-12-06 00:33:13,008 INFO L131 PetriNetUnfolder]: For 35039/35039 co-relation queries the response was YES. [2022-12-06 00:33:13,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16014 conditions, 1835 events. 915/1835 cut-off events. For 35039/35039 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11375 event pairs, 196 based on Foata normal form. 6/1837 useless extension candidates. Maximal degree in co-relation 13777. Up to 1109 conditions per place. [2022-12-06 00:33:13,020 INFO L137 encePairwiseOnDemand]: 38/69 looper letters, 198 selfloop transitions, 99 changer transitions 2/299 dead transitions. [2022-12-06 00:33:13,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 299 transitions, 6100 flow [2022-12-06 00:33:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 00:33:13,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 00:33:13,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 137 transitions. [2022-12-06 00:33:13,021 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.12409420289855072 [2022-12-06 00:33:13,021 INFO L175 Difference]: Start difference. First operand has 147 places, 217 transitions, 4272 flow. Second operand 16 states and 137 transitions. [2022-12-06 00:33:13,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 299 transitions, 6100 flow [2022-12-06 00:33:13,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 299 transitions, 5156 flow, removed 378 selfloop flow, removed 11 redundant places. [2022-12-06 00:33:13,217 INFO L231 Difference]: Finished difference. Result has 160 places, 270 transitions, 4699 flow [2022-12-06 00:33:13,217 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=69, PETRI_DIFFERENCE_MINUEND_FLOW=3517, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4699, PETRI_PLACES=160, PETRI_TRANSITIONS=270} [2022-12-06 00:33:13,218 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 139 predicate places. [2022-12-06 00:33:13,218 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:33:13,218 INFO L89 Accepts]: Start accepts. Operand has 160 places, 270 transitions, 4699 flow [2022-12-06 00:33:13,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:33:13,219 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:33:13,219 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 270 transitions, 4699 flow [2022-12-06 00:33:13,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 270 transitions, 4699 flow [2022-12-06 00:33:13,342 INFO L130 PetriNetUnfolder]: 241/813 cut-off events. [2022-12-06 00:33:13,343 INFO L131 PetriNetUnfolder]: For 12061/12067 co-relation queries the response was YES. [2022-12-06 00:33:13,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5835 conditions, 813 events. 241/813 cut-off events. For 12061/12067 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5966 event pairs, 5 based on Foata normal form. 2/807 useless extension candidates. Maximal degree in co-relation 5536. Up to 245 conditions per place. [2022-12-06 00:33:13,354 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 270 transitions, 4699 flow [2022-12-06 00:33:13,355 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 00:33:13,832 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 00:33:15,294 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 00:33:18,612 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 00:33:18,805 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 00:33:18,806 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5588 [2022-12-06 00:33:18,806 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 269 transitions, 4763 flow [2022-12-06 00:33:18,806 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 00:33:18,806 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:33:18,806 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:33:18,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-06 00:33:19,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-12-06 00:33:19,012 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 00:33:19,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:33:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1486119477, now seen corresponding path program 1 times [2022-12-06 00:33:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:33:19,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871836611] [2022-12-06 00:33:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:19,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:33:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:33:19,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:33:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871836611] [2022-12-06 00:33:19,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871836611] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:33:19,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547624006] [2022-12-06 00:33:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:33:19,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:33:19,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:33:19,094 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 00:33:19,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-06 00:33:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:33:19,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 00:33:19,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:33:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:33:19,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:33:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 00:33:19,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547624006] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:33:19,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:33:19,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-06 00:33:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374420580] [2022-12-06 00:33:19,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:33:19,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 00:33:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:33:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 00:33:19,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-06 00:33:19,326 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 78 [2022-12-06 00:33:19,327 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 269 transitions, 4763 flow. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:33:19,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:33:19,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 78 [2022-12-06 00:33:19,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:33:20,274 INFO L130 PetriNetUnfolder]: 950/1904 cut-off events. [2022-12-06 00:33:20,274 INFO L131 PetriNetUnfolder]: For 31238/31238 co-relation queries the response was YES. [2022-12-06 00:33:20,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15482 conditions, 1904 events. 950/1904 cut-off events. For 31238/31238 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11862 event pairs, 340 based on Foata normal form. 32/1930 useless extension candidates. Maximal degree in co-relation 14829. Up to 1763 conditions per place. [2022-12-06 00:33:20,286 INFO L137 encePairwiseOnDemand]: 64/78 looper letters, 250 selfloop transitions, 44 changer transitions 5/299 dead transitions. [2022-12-06 00:33:20,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 299 transitions, 5920 flow [2022-12-06 00:33:20,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 00:33:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 00:33:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-12-06 00:33:20,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.15954415954415954 [2022-12-06 00:33:20,287 INFO L175 Difference]: Start difference. First operand has 159 places, 269 transitions, 4763 flow. Second operand 9 states and 112 transitions. [2022-12-06 00:33:20,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 299 transitions, 5920 flow [2022-12-06 00:33:20,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 299 transitions, 5660 flow, removed 115 selfloop flow, removed 2 redundant places. [2022-12-06 00:33:20,424 INFO L231 Difference]: Finished difference. Result has 168 places, 281 transitions, 4960 flow [2022-12-06 00:33:20,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=4503, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4960, PETRI_PLACES=168, PETRI_TRANSITIONS=281} [2022-12-06 00:33:20,424 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 147 predicate places. [2022-12-06 00:33:20,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:33:20,424 INFO L89 Accepts]: Start accepts. Operand has 168 places, 281 transitions, 4960 flow [2022-12-06 00:33:20,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:33:20,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:33:20,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 281 transitions, 4960 flow [2022-12-06 00:33:20,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 281 transitions, 4960 flow [2022-12-06 00:33:20,553 INFO L130 PetriNetUnfolder]: 251/839 cut-off events. [2022-12-06 00:33:20,553 INFO L131 PetriNetUnfolder]: For 14035/14041 co-relation queries the response was YES. [2022-12-06 00:33:20,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6285 conditions, 839 events. 251/839 cut-off events. For 14035/14041 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6189 event pairs, 5 based on Foata normal form. 2/831 useless extension candidates. Maximal degree in co-relation 5984. Up to 239 conditions per place. [2022-12-06 00:33:20,563 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 281 transitions, 4960 flow [2022-12-06 00:33:20,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 00:33:20,565 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [887] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_617| v_~f~0.base_474))) (let ((.cse3 (select .cse1 (+ v_~f~0.offset_470 (* v_~x2~0_643 4))))) (let ((.cse5 (select .cse1 (+ v_~f~0.offset_470 (* .cse3 4))))) (let ((.cse4 (select .cse1 (+ v_~f~0.offset_470 (* .cse5 4))))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_470 (* .cse4 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_470 (* .cse2 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_643) (< v_~x2~0_643 v_~size~0_471)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| (ite (and (< .cse0 v_~size~0_471) (<= 0 .cse0)) 1 0)) (= (select .cse1 (+ (* .cse0 4) v_~f~0.offset_470)) v_~x2~0_641) (= 6 |v_thread2Thread1of1ForFork1_~i~1#1_525|) (= (select .cse1 (+ v_~f~0.offset_470 (* v_~x1~0_930 4))) v_~x1~0_929) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528| 0)) (not (= (ite (and (< .cse2 v_~size~0_471) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_471)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_512| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528|) (not (= (ite (and (<= 0 .cse4) (< .cse4 v_~size~0_471)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_400|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_512| (ite (and (<= 0 v_~x1~0_930) (< v_~x1~0_930 v_~size~0_471)) 1 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_525| 4294967293) 4294967296) (mod (* 3 v_~n~0_461) 4294967296)) (= |v_thread1Thread1of1ForFork0_~i~0#1_722| 1) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_400| 0)) (not (= (ite (and (< .cse5 v_~size~0_471) (<= 0 .cse5)) 1 0) 0))))))))) InVars {~x2~0=v_~x2~0_643, ~size~0=v_~size~0_471, ~f~0.base=v_~f~0.base_474, #memory_int=|v_#memory_int_617|, ~n~0=v_~n~0_461, ~x1~0=v_~x1~0_930, ~f~0.offset=v_~f~0.offset_470} OutVars{~x2~0=v_~x2~0_641, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_520|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_360|, ~size~0=v_~size~0_471, ~f~0.base=v_~f~0.base_474, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_332|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_368|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_525|, ~x1~0=v_~x1~0_929, ~f~0.offset=v_~f~0.offset_470, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_400|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_512|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_324|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_722|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_322|, #memory_int=|v_#memory_int_617|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_528|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_332|, ~n~0=v_~n~0_461, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_336|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_530|} 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 00:33:21,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [891] $Ultimate##0-->L59-2: Formula: (let ((.cse8 (select |v_#memory_int_621| v_~f~0.base_478))) (let ((.cse6 (select .cse8 (+ v_~f~0.offset_474 (* v_~x2~0_655 4))))) (let ((.cse10 (select .cse8 (+ v_~f~0.offset_474 (* .cse6 4))))) (let ((.cse5 (select .cse8 (+ v_~f~0.offset_474 (* .cse10 4))))) (let ((.cse0 (select .cse8 (+ v_~f~0.offset_474 (* .cse5 4))))) (let ((.cse3 (select .cse8 (+ v_~f~0.offset_474 (* .cse0 4))))) (let ((.cse2 (select .cse8 (+ v_~f~0.offset_474 (* .cse3 4))))) (let ((.cse9 (select .cse8 (+ v_~f~0.offset_474 (* v_~x1~0_941 4)))) (.cse7 (select .cse8 (+ v_~f~0.offset_474 (* .cse2 4))))) (let ((.cse4 (select .cse8 (+ v_~f~0.offset_474 (* .cse7 4)))) (.cse1 (select .cse8 (+ v_~f~0.offset_474 (* 4 .cse9))))) (and (not (= (ite (and (<= 0 .cse0) (< .cse0 v_~size~0_475)) 1 0) 0)) (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_475)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_518|) (not (= (ite (and (< .cse2 v_~size~0_475) (<= 0 .cse2)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_518| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_534|) (not (= (ite (and (<= 0 .cse3) (< .cse3 v_~size~0_475)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| (ite (and (< .cse4 v_~size~0_475) (<= 0 .cse4)) 1 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_534| 0)) (= 9 |v_thread2Thread1of1ForFork1_~i~1#1_533|) (not (= (ite (and (< v_~x2~0_655 v_~size~0_475) (<= 0 v_~x2~0_655)) 1 0) 0)) (not (= (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_475)) 1 0) 0)) (not (= (ite (and (<= 0 .cse6) (< .cse6 v_~size~0_475)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_475)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_376| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|) (= v_~x2~0_653 (select .cse8 (+ v_~f~0.offset_474 (* .cse4 4)))) (= (select .cse8 (+ v_~f~0.offset_474 (* 4 .cse1))) v_~x1~0_939) (not (= (ite (and (<= 0 v_~x1~0_941) (< v_~x1~0_941 v_~size~0_475)) 1 0) 0)) (not (= 0 (ite (and (<= 0 .cse9) (< .cse9 v_~size~0_475)) 1 0))) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_533| 4294967293) 4294967296) (mod (* 3 v_~n~0_465) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408| 0)) (not (= (ite (and (< .cse10 v_~size~0_475) (<= 0 .cse10)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_~i~0#1_728| 3))))))))))) InVars {~x2~0=v_~x2~0_655, ~size~0=v_~size~0_475, ~f~0.base=v_~f~0.base_478, #memory_int=|v_#memory_int_621|, ~n~0=v_~n~0_465, ~x1~0=v_~x1~0_941, ~f~0.offset=v_~f~0.offset_474} OutVars{~x2~0=v_~x2~0_653, thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_526|, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_368|, ~size~0=v_~size~0_475, ~f~0.base=v_~f~0.base_478, 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_533|, ~x1~0=v_~x1~0_939, ~f~0.offset=v_~f~0.offset_474, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_408|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_518|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_332|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_728|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_330|, #memory_int=|v_#memory_int_621|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_534|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_340|, ~n~0=v_~n~0_465, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_344|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_536|} 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 00:33:25,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-06 00:33:25,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:33:25,303 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 13 out of bounds for length 13 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 00:33:25,305 INFO L158 Benchmark]: Toolchain (without parser) took 309275.66ms. Allocated memory was 127.9MB in the beginning and 692.1MB in the end (delta: 564.1MB). Free memory was 102.6MB in the beginning and 236.6MB in the end (delta: -134.1MB). Peak memory consumption was 439.9MB. Max. memory is 8.0GB. [2022-12-06 00:33:25,306 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 105.3MB in the beginning and 105.2MB in the end (delta: 74.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:33:25,306 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.90ms. Allocated memory is still 127.9MB. Free memory was 102.3MB in the beginning and 90.9MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 00:33:25,306 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.11ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:33:25,308 INFO L158 Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 127.9MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:33:25,308 INFO L158 Benchmark]: RCFGBuilder took 403.34ms. Allocated memory is still 127.9MB. Free memory was 87.3MB in the beginning and 100.7MB in the end (delta: -13.4MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2022-12-06 00:33:25,309 INFO L158 Benchmark]: TraceAbstraction took 308548.43ms. Allocated memory was 127.9MB in the beginning and 692.1MB in the end (delta: 564.1MB). Free memory was 100.2MB in the beginning and 236.6MB in the end (delta: -136.5MB). Peak memory consumption was 436.2MB. Max. memory is 8.0GB. [2022-12-06 00:33:25,310 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 105.3MB in the beginning and 105.2MB in the end (delta: 74.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 241.90ms. Allocated memory is still 127.9MB. Free memory was 102.3MB in the beginning and 90.9MB in the end (delta: 11.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 45.11ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 88.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.11ms. Allocated memory is still 127.9MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.34ms. Allocated memory is still 127.9MB. Free memory was 87.3MB in the beginning and 100.7MB in the end (delta: -13.4MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. * TraceAbstraction took 308548.43ms. Allocated memory was 127.9MB in the beginning and 692.1MB in the end (delta: 564.1MB). Free memory was 100.2MB in the beginning and 236.6MB in the end (delta: -136.5MB). Peak memory consumption was 436.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 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: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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.4s, 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: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, 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: 20, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 13, dependent conditional: 13, 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: 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] ], 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.6s, 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.6s, 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.2s, 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.8s, 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.5s, 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: 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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): 134, Positive cache size: 126, Positive conditional cache size: 103, Positive unconditional cache size: 23, 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.0s, 110 PlacesBefore, 110 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 330 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): 134, Positive cache size: 126, Positive conditional cache size: 103, Positive unconditional cache size: 23, 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, 110 PlacesBefore, 110 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 324 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): 134, Positive cache size: 126, Positive conditional cache size: 103, Positive unconditional cache size: 23, 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.8s, 113 PlacesBefore, 109 PlacesAfterwards, 98 TransitionsBefore, 95 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 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): 141, Positive cache size: 133, Positive conditional cache size: 110, Positive unconditional cache size: 23, 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, 98 PlacesBefore, 98 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 284 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): 141, Positive cache size: 133, Positive conditional cache size: 110, Positive unconditional cache size: 23, 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: 4.6s, 108 PlacesBefore, 111 PlacesAfterwards, 123 TransitionsBefore, 124 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 141, Positive conditional cache size: 117, 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: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 97 PlacesBefore, 97 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 376 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): 151, Positive cache size: 143, Positive conditional cache size: 118, 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: 0.4s, 101 PlacesBefore, 99 PlacesAfterwards, 118 TransitionsBefore, 116 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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): 152, Positive cache size: 144, Positive conditional cache size: 119, 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: 0.4s, 97 PlacesBefore, 96 PlacesAfterwards, 117 TransitionsBefore, 116 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 372 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): 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 91 PlacesBefore, 90 PlacesAfterwards, 80 TransitionsBefore, 79 TransitionsAfterwards, 288 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 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.0s, 87 PlacesBefore, 87 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 10, 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: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 151, Positive conditional cache size: 124, Positive unconditional cache size: 27, 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.1s, 83 PlacesBefore, 82 PlacesAfterwards, 79 TransitionsBefore, 78 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 151, Positive conditional cache size: 124, Positive unconditional cache size: 27, 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: 20.9s, 92 PlacesBefore, 91 PlacesAfterwards, 87 TransitionsBefore, 86 TransitionsAfterwards, 304 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 170, Positive conditional cache size: 140, 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: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 172, Positive conditional cache size: 142, 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.3s, 83 PlacesBefore, 83 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 278, Positive conditional cache size: 245, 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.2s, 89 PlacesBefore, 89 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 318, Positive conditional cache size: 284, Positive unconditional cache size: 34, 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.6s, 98 PlacesBefore, 96 PlacesAfterwards, 122 TransitionsBefore, 121 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 114, independent conditional: 114, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 2, 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: 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: 114, independent: 110, independent conditional: 28, independent unconditional: 82, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 330, Positive cache size: 322, Positive conditional cache size: 286, 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: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 100 PlacesBefore, 100 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 346 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): 364, Positive cache size: 356, Positive conditional cache size: 319, Positive unconditional cache size: 37, 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: 7.4s, 106 PlacesBefore, 106 PlacesAfterwards, 132 TransitionsBefore, 132 TransitionsAfterwards, 352 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 11, 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: 11, independent: 8, independent conditional: 8, 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): 409, Positive cache size: 401, Positive conditional cache size: 363, Positive unconditional cache size: 38, 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, 136 TransitionsBefore, 136 TransitionsAfterwards, 360 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): 409, Positive cache size: 401, Positive conditional cache size: 363, Positive unconditional cache size: 38, 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.9s, 113 PlacesBefore, 113 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 405, Positive conditional cache size: 367, Positive unconditional cache size: 38, 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, 128 PlacesBefore, 128 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 416 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): 413, Positive cache size: 405, Positive conditional cache size: 367, Positive unconditional cache size: 38, 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.9s, 135 PlacesBefore, 135 PlacesAfterwards, 179 TransitionsBefore, 179 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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: 7, independent: 6, independent conditional: 6, 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): 414, Positive cache size: 406, Positive conditional cache size: 368, Positive unconditional cache size: 38, 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, 147 PlacesBefore, 147 PlacesAfterwards, 217 TransitionsBefore, 217 TransitionsAfterwards, 534 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): 414, Positive cache size: 406, Positive conditional cache size: 368, Positive unconditional cache size: 38, 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.5s, 160 PlacesBefore, 159 PlacesAfterwards, 270 TransitionsBefore, 269 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 456, Positive conditional cache size: 415, Positive unconditional cache size: 41, 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 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 13 out of bounds for length 13 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 13 out of bounds for length 13: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 00:33:25,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...