/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:35:27,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:35:27,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:35:27,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:35:27,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:35:27,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:35:27,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:35:27,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:35:27,511 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:35:27,511 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:35:27,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:35:27,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:35:27,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:35:27,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:35:27,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:35:27,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:35:27,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:35:27,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:35:27,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:35:27,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:35:27,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:35:27,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:35:27,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:35:27,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:35:27,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:35:27,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:35:27,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:35:27,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:35:27,531 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:35:27,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:35:27,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:35:27,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:35:27,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:35:27,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:35:27,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:35:27,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:35:27,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:35:27,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:35:27,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:35:27,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:35:27,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:35:27,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:35:27,550 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:35:27,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:35:27,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:35:27,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:35:27,552 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:35:27,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:35:27,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:35:27,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:35:27,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:35:27,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:35:27,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:35:27,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:35:27,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:35:27,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:35:27,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:35:27,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:35:27,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:35:27,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:35:27,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:35:27,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:35:27,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:35:27,555 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:35:27,555 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 05:35:27,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:35:27,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:35:27,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:35:27,832 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:35:27,832 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:35:27,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-06 05:35:28,903 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:35:29,117 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:35:29,118 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-12-06 05:35:29,123 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dbea9d4/13355bc48d684382b05059ecae98d70f/FLAGdc960a282 [2022-12-06 05:35:29,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dbea9d4/13355bc48d684382b05059ecae98d70f [2022-12-06 05:35:29,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:35:29,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:35:29,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:35:29,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:35:29,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:35:29,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9424ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29, skipping insertion in model container [2022-12-06 05:35:29,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:35:29,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:35:29,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:29,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:29,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:29,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:29,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:29,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:29,283 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-12-06 05:35:29,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:35:29,296 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:35:29,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:29,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:29,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:29,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:29,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:35:29,324 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:35:29,336 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2022-12-06 05:35:29,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:35:29,351 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:35:29,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29 WrapperNode [2022-12-06 05:35:29,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:35:29,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:35:29,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:35:29,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:35:29,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,407 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-06 05:35:29,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:35:29,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:35:29,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:35:29,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:35:29,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,451 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:35:29,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:35:29,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:35:29,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:35:29,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (1/1) ... [2022-12-06 05:35:29,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:35:29,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:29,501 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 05:35:29,520 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 05:35:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:35:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:35:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:35:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:35:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:35:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:35:29,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:35:29,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:35:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:35:29,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:35:29,540 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 05:35:29,664 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:35:29,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:35:29,929 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:35:29,974 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:35:29,974 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:35:29,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:35:29 BoogieIcfgContainer [2022-12-06 05:35:29,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:35:29,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:35:29,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:35:29,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:35:29,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:35:29" (1/3) ... [2022-12-06 05:35:29,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed47cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:35:29, skipping insertion in model container [2022-12-06 05:35:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:35:29" (2/3) ... [2022-12-06 05:35:29,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed47cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:35:29, skipping insertion in model container [2022-12-06 05:35:29,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:35:29" (3/3) ... [2022-12-06 05:35:29,983 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-12-06 05:35:30,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:35:30,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:35:30,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:35:30,074 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:35:30,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 142 transitions, 308 flow [2022-12-06 05:35:30,175 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-12-06 05:35:30,175 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:35:30,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 12/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-06 05:35:30,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 142 transitions, 308 flow [2022-12-06 05:35:30,183 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 276 flow [2022-12-06 05:35:30,192 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:30,204 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-06 05:35:30,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 276 flow [2022-12-06 05:35:30,240 INFO L130 PetriNetUnfolder]: 12/129 cut-off events. [2022-12-06 05:35:30,240 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:35:30,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 12/129 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 87 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2022-12-06 05:35:30,243 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 129 transitions, 276 flow [2022-12-06 05:35:30,243 INFO L188 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-06 05:35:35,359 INFO L203 LiptonReduction]: Total number of compositions: 105 [2022-12-06 05:35:35,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:35:35,376 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;@7501014c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:35:35,376 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:35:35,382 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-06 05:35:35,382 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:35:35,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:35,383 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:35,384 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1106873309, now seen corresponding path program 1 times [2022-12-06 05:35:35,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:35,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885751503] [2022-12-06 05:35:35,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:35,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:35,839 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 05:35:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:35,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885751503] [2022-12-06 05:35:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885751503] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:35,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:35:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627070959] [2022-12-06 05:35:35,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:35,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:35:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:35,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:35:35,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:35:35,861 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:35:35,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 05:35:35,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:35,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:35:35,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:35,947 INFO L130 PetriNetUnfolder]: 269/376 cut-off events. [2022-12-06 05:35:35,948 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 05:35:35,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 376 events. 269/376 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1110 event pairs, 133 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 615. Up to 373 conditions per place. [2022-12-06 05:35:35,952 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-06 05:35:35,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-06 05:35:35,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:35:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:35:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:35:35,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 05:35:35,963 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:35:35,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-06 05:35:35,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:35:35,973 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:35,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2022-12-06 05:35:35,979 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-06 05:35:35,979 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:35,980 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:35,982 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:35,982 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:35,982 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:35,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:35,992 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:35:35,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:35:35,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 25 events. 4/25 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-06 05:35:35,995 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-06 05:35:35,995 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 05:35:37,104 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:37,105 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1126 [2022-12-06 05:35:37,105 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-06 05:35:37,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 05:35:37,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:37,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:37,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:35:37,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:37,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1795349165, now seen corresponding path program 1 times [2022-12-06 05:35:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:37,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663907948] [2022-12-06 05:35:37,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:37,227 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 05:35:37,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:37,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663907948] [2022-12-06 05:35:37,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663907948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:37,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:37,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:35:37,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437028546] [2022-12-06 05:35:37,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:37,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:35:37,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:37,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:35:37,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:35:37,230 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-06 05:35:37,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 05:35:37,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:37,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-06 05:35:37,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:37,309 INFO L130 PetriNetUnfolder]: 309/441 cut-off events. [2022-12-06 05:35:37,309 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:35:37,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 441 events. 309/441 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1405 event pairs, 49 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 889. Up to 335 conditions per place. [2022-12-06 05:35:37,313 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 29 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-12-06 05:35:37,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 148 flow [2022-12-06 05:35:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:35:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:35:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 05:35:37,316 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2022-12-06 05:35:37,316 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 4 states and 41 transitions. [2022-12-06 05:35:37,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 148 flow [2022-12-06 05:35:37,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 34 transitions, 140 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:37,318 INFO L231 Difference]: Finished difference. Result has 28 places, 25 transitions, 68 flow [2022-12-06 05:35:37,318 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=28, PETRI_TRANSITIONS=25} [2022-12-06 05:35:37,318 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2022-12-06 05:35:37,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:37,319 INFO L89 Accepts]: Start accepts. Operand has 28 places, 25 transitions, 68 flow [2022-12-06 05:35:37,320 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:37,320 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:37,320 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-06 05:35:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 68 flow [2022-12-06 05:35:37,323 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:35:37,323 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:35:37,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 4/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2022-12-06 05:35:37,324 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 25 transitions, 68 flow [2022-12-06 05:35:37,324 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 05:35:37,401 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:35:37,402 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:35:37,402 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 64 flow [2022-12-06 05:35:37,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 05:35:37,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:37,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:37,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:35:37,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:37,404 INFO L85 PathProgramCache]: Analyzing trace with hash -257711172, now seen corresponding path program 1 times [2022-12-06 05:35:37,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:37,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351195040] [2022-12-06 05:35:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:37,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:37,496 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 05:35:37,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:37,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351195040] [2022-12-06 05:35:37,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351195040] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:35:37,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:35:37,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:35:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741839108] [2022-12-06 05:35:37,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:35:37,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:35:37,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:37,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:35:37,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:35:37,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:35:37,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 05:35:37,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:37,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:35:37,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:37,644 INFO L130 PetriNetUnfolder]: 464/682 cut-off events. [2022-12-06 05:35:37,644 INFO L131 PetriNetUnfolder]: For 224/224 co-relation queries the response was YES. [2022-12-06 05:35:37,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1596 conditions, 682 events. 464/682 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2193 event pairs, 138 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1114. Up to 325 conditions per place. [2022-12-06 05:35:37,648 INFO L137 encePairwiseOnDemand]: 17/24 looper letters, 54 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2022-12-06 05:35:37,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 64 transitions, 304 flow [2022-12-06 05:35:37,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:35:37,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:35:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-06 05:35:37,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-06 05:35:37,650 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 64 flow. Second operand 7 states and 66 transitions. [2022-12-06 05:35:37,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 64 transitions, 304 flow [2022-12-06 05:35:37,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 64 transitions, 270 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 05:35:37,653 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 110 flow [2022-12-06 05:35:37,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2022-12-06 05:35:37,654 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2022-12-06 05:35:37,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:37,654 INFO L89 Accepts]: Start accepts. Operand has 33 places, 30 transitions, 110 flow [2022-12-06 05:35:37,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:37,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:37,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-06 05:35:37,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 110 flow [2022-12-06 05:35:37,662 INFO L130 PetriNetUnfolder]: 13/58 cut-off events. [2022-12-06 05:35:37,662 INFO L131 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-12-06 05:35:37,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 58 events. 13/58 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 72. Up to 12 conditions per place. [2022-12-06 05:35:37,663 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 110 flow [2022-12-06 05:35:37,663 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 05:35:37,664 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:35:37,665 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:35:37,665 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 110 flow [2022-12-06 05:35:37,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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 05:35:37,665 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:37,665 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:37,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:35:37,666 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash 185042541, now seen corresponding path program 1 times [2022-12-06 05:35:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:37,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800482762] [2022-12-06 05:35:37,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:37,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:38,754 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 05:35:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:38,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800482762] [2022-12-06 05:35:38,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800482762] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:38,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375472132] [2022-12-06 05:35:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:38,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:38,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:38,762 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 05:35:38,815 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 05:35:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:38,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-06 05:35:38,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:39,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 05:35:39,091 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 05:35:39,170 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 05:35:39,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:35:39,315 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 35 treesize of output 33 [2022-12-06 05:35:39,429 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:39,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 46 [2022-12-06 05:35:39,612 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 05:35:39,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:35:40,021 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~min2~0 c_~min1~0))) (and (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (not (< ~M~0 c_~N~0)) (not (< .cse0 c_~min3~0)) (<= c_~min2~0 .cse0) (< (+ ~M~0 1) c_~N~0)))) (or .cse1 (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< .cse2 c_~min3~0)) (< .cse2 c_~min2~0) (< (+ ~M~0 1) c_~N~0))))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse1 (< c_~min3~0 c_~min2~0))) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))))) is different from false [2022-12-06 05:35:52,403 WARN L233 SmtUtils]: Spent 10.14s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 05:35:52,607 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse3 (= c_~min2~0 c_~min1~0)) (.cse4 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse2 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (< (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< ~M~0 c_~N~0)) (not (< .cse2 c_~min1~0)) (= c_~min3~0 .cse2) (< (+ ~M~0 1) c_~N~0)))))) (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse3 .cse4)) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (or (< (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (< .cse6 c_~min2~0) (not (< .cse6 c_~min3~0)) (< (+ ~M~0 1) c_~N~0)))) (not (< .cse8 c_~min1~0)) (= c_~min2~0 .cse8))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse9 (select (select .cse11 c_~A~0.base) c_~A~0.offset))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse10 (select (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse9 .cse10) (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse10) (not (< .cse10 c_~min3~0)) (< (+ ~M~0 1) c_~N~0)))) (not (< .cse9 c_~min1~0)))))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse13 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< (select (select .cse12 c_~A~0.base) c_~A~0.offset) c_~min1~0) (not (< ~M~0 c_~N~0)) (< .cse13 c_~min2~0) (not (< .cse13 c_~min3~0)) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse15 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (< (select (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< ~M~0 c_~N~0)) (not (< .cse15 c_~min1~0)) (= c_~min2~0 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse4) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (or (< (select (select .cse16 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((~M~0 Int) (v_ArrVal_113 (Array Int Int))) (let ((.cse17 (select (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse17) (not (< ~M~0 c_~N~0)) (<= c_~min2~0 .cse17) (not (< .cse17 c_~min3~0)) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-12-06 05:35:53,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 05:35:53,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375472132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:35:53,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:35:53,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 23 [2022-12-06 05:35:53,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754090162] [2022-12-06 05:35:53,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:35:53,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:35:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:35:53,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:35:53,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=420, Unknown=2, NotChecked=86, Total=600 [2022-12-06 05:35:53,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 24 [2022-12-06 05:35:53,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 110 flow. Second operand has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:53,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:35:53,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 24 [2022-12-06 05:35:53,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:35:55,413 INFO L130 PetriNetUnfolder]: 817/1255 cut-off events. [2022-12-06 05:35:55,414 INFO L131 PetriNetUnfolder]: For 711/739 co-relation queries the response was YES. [2022-12-06 05:35:55,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 1255 events. 817/1255 cut-off events. For 711/739 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5092 event pairs, 74 based on Foata normal form. 30/1117 useless extension candidates. Maximal degree in co-relation 1515. Up to 706 conditions per place. [2022-12-06 05:35:55,419 INFO L137 encePairwiseOnDemand]: 8/24 looper letters, 93 selfloop transitions, 52 changer transitions 6/153 dead transitions. [2022-12-06 05:35:55,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 153 transitions, 816 flow [2022-12-06 05:35:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 05:35:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 05:35:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 151 transitions. [2022-12-06 05:35:55,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4494047619047619 [2022-12-06 05:35:55,421 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 110 flow. Second operand 14 states and 151 transitions. [2022-12-06 05:35:55,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 153 transitions, 816 flow [2022-12-06 05:35:55,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 153 transitions, 788 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:35:55,425 INFO L231 Difference]: Finished difference. Result has 50 places, 79 transitions, 484 flow [2022-12-06 05:35:55,425 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=484, PETRI_PLACES=50, PETRI_TRANSITIONS=79} [2022-12-06 05:35:55,426 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-06 05:35:55,426 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:35:55,426 INFO L89 Accepts]: Start accepts. Operand has 50 places, 79 transitions, 484 flow [2022-12-06 05:35:55,427 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:35:55,427 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:35:55,427 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 79 transitions, 484 flow [2022-12-06 05:35:55,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 79 transitions, 484 flow [2022-12-06 05:35:55,456 INFO L130 PetriNetUnfolder]: 252/536 cut-off events. [2022-12-06 05:35:55,456 INFO L131 PetriNetUnfolder]: For 465/487 co-relation queries the response was YES. [2022-12-06 05:35:55,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 536 events. 252/536 cut-off events. For 465/487 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2702 event pairs, 62 based on Foata normal form. 4/516 useless extension candidates. Maximal degree in co-relation 1355. Up to 226 conditions per place. [2022-12-06 05:35:55,460 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 79 transitions, 484 flow [2022-12-06 05:35:55,460 INFO L188 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-06 05:35:55,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:35:55,577 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:35:58,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:35:58,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:35:58,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:35:58,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:35:58,555 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:35:58,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:35:58,754 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:35:58,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3329 [2022-12-06 05:35:58,755 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 77 transitions, 526 flow [2022-12-06 05:35:58,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.24) internal successors, (81), 25 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:35:58,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:35:58,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:35:58,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:35:58,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:58,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:35:58,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:35:58,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1595953813, now seen corresponding path program 1 times [2022-12-06 05:35:58,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:35:58,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539529406] [2022-12-06 05:35:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:58,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:35:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:59,452 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 05:35:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:35:59,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539529406] [2022-12-06 05:35:59,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539529406] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:35:59,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376076526] [2022-12-06 05:35:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:35:59,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:35:59,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:35:59,455 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 05:35:59,457 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 05:35:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:35:59,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 05:35:59,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:35:59,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:35:59,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 89 [2022-12-06 05:36:00,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 05:36:00,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:00,443 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 05:36:00,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 67 [2022-12-06 05:36:00,510 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 05:36:00,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376076526] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:00,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:00,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 15 [2022-12-06 05:36:00,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855717972] [2022-12-06 05:36:00,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:00,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:36:00,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:00,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:36:00,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:36:00,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:36:00,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 77 transitions, 526 flow. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:00,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:00,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:36:00,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:01,745 INFO L130 PetriNetUnfolder]: 1133/1779 cut-off events. [2022-12-06 05:36:01,745 INFO L131 PetriNetUnfolder]: For 4006/4043 co-relation queries the response was YES. [2022-12-06 05:36:01,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 1779 events. 1133/1779 cut-off events. For 4006/4043 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8024 event pairs, 263 based on Foata normal form. 35/1811 useless extension candidates. Maximal degree in co-relation 6600. Up to 1290 conditions per place. [2022-12-06 05:36:01,753 INFO L137 encePairwiseOnDemand]: 17/33 looper letters, 117 selfloop transitions, 58 changer transitions 8/185 dead transitions. [2022-12-06 05:36:01,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 185 transitions, 1506 flow [2022-12-06 05:36:01,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:36:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:36:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2022-12-06 05:36:01,760 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2905525846702317 [2022-12-06 05:36:01,761 INFO L175 Difference]: Start difference. First operand has 48 places, 77 transitions, 526 flow. Second operand 17 states and 163 transitions. [2022-12-06 05:36:01,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 185 transitions, 1506 flow [2022-12-06 05:36:01,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 185 transitions, 1449 flow, removed 27 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:01,774 INFO L231 Difference]: Finished difference. Result has 69 places, 123 transitions, 1029 flow [2022-12-06 05:36:01,775 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1029, PETRI_PLACES=69, PETRI_TRANSITIONS=123} [2022-12-06 05:36:01,777 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 05:36:01,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:01,777 INFO L89 Accepts]: Start accepts. Operand has 69 places, 123 transitions, 1029 flow [2022-12-06 05:36:01,778 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:01,778 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:01,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 123 transitions, 1029 flow [2022-12-06 05:36:01,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 123 transitions, 1029 flow [2022-12-06 05:36:01,831 INFO L130 PetriNetUnfolder]: 444/915 cut-off events. [2022-12-06 05:36:01,831 INFO L131 PetriNetUnfolder]: For 2295/2346 co-relation queries the response was YES. [2022-12-06 05:36:01,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 915 events. 444/915 cut-off events. For 2295/2346 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5253 event pairs, 85 based on Foata normal form. 9/880 useless extension candidates. Maximal degree in co-relation 3228. Up to 316 conditions per place. [2022-12-06 05:36:01,838 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 123 transitions, 1029 flow [2022-12-06 05:36:01,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 728 [2022-12-06 05:36:01,857 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:36:01,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [565] L70-4-->L58-4: Formula: (and (< v_thread2Thread1of1ForFork2_~i~1_42 v_~M~0_61) (= (+ v_thread2Thread1of1ForFork2_~i~1_42 1) v_thread2Thread1of1ForFork2_~i~1_41) (= |v_thread3Thread1of1ForFork0_#res.offset_23| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_23|) (let ((.cse1 (select (select |v_#memory_int_195| v_~A~0.base_102) (+ v_~A~0.offset_102 (* 4 v_thread2Thread1of1ForFork2_~i~1_42))))) (let ((.cse0 (< .cse1 v_~min2~0_81))) (or (and (= |v_thread2Thread1of1ForFork2_#t~mem6_37| |v_thread2Thread1of1ForFork2_#t~mem6_36|) (= v_~min2~0_81 v_~min2~0_80) (not .cse0)) (and .cse0 (= v_~min2~0_80 .cse1))))) (not (< v_thread3Thread1of1ForFork0_~i~2_45 v_~N~0_87))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_37|, ~A~0.base=v_~A~0.base_102, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_42, ~A~0.offset=v_~A~0.offset_102, ~M~0=v_~M~0_61, #memory_int=|v_#memory_int_195|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, ~N~0=v_~N~0_87, ~min2~0=v_~min2~0_81} OutVars{~A~0.base=v_~A~0.base_102, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_45, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_23|, ~N~0=v_~N~0_87, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_28|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_36|, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_41, ~A~0.offset=v_~A~0.offset_102, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_20|, ~M~0=v_~M~0_61, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_23|, #memory_int=|v_#memory_int_195|, ~min2~0=v_~min2~0_80} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base, ~min2~0] [2022-12-06 05:36:02,134 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:02,134 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:02,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:02,421 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [566] L70-4-->L46-4: Formula: (and (= 0 |v_thread3Thread1of1ForFork0_#res.base_25|) (not (< v_thread3Thread1of1ForFork0_~i~2_47 v_~N~0_89)) (let ((.cse1 (select (select |v_#memory_int_197| v_~A~0.base_104) (+ v_~A~0.offset_104 (* v_thread1Thread1of1ForFork1_~i~0_48 4))))) (let ((.cse0 (< .cse1 v_~min1~0_89))) (or (and .cse0 (= v_~min1~0_88 .cse1)) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_43| |v_thread1Thread1of1ForFork1_#t~mem3_42|) (not .cse0) (= v_~min1~0_89 v_~min1~0_88))))) (< v_thread1Thread1of1ForFork1_~i~0_48 v_~N~0_89) (= v_thread1Thread1of1ForFork1_~i~0_47 (+ v_thread1Thread1of1ForFork1_~i~0_48 1)) (= |v_thread3Thread1of1ForFork0_#res.offset_25| 0)) InVars {~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_43|, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_48, ~N~0=v_~N~0_89, ~min1~0=v_~min1~0_89} OutVars{~A~0.base=v_~A~0.base_104, ~A~0.offset=v_~A~0.offset_104, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_23|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_42|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_31|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_25|, #memory_int=|v_#memory_int_197|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_47, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_25|, ~N~0=v_~N~0_89, ~min1~0=v_~min1~0_88} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] [2022-12-06 05:36:02,421 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:02,421 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:02,625 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:36:02,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_71 1) (= |v_thread1Thread1of1ForFork1_#res.offset_15| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_71 v_~N~0_107)) (let ((.cse0 (select (select |v_#memory_int_217| v_~A~0.base_122) (+ v_~A~0.offset_122 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_71 4))))) (let ((.cse1 (< .cse0 v_~min1~0_127))) (or (and (= v_~min1~0_126 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_82| |v_thread1Thread1of1ForFork1_#t~mem3_81|) (= v_~min1~0_127 v_~min1~0_126) (not .cse1))))) (< v_thread1Thread1of1ForFork1_~i~0_71 (+ v_~N~0_107 1)) (= |v_thread1Thread1of1ForFork1_#res.base_15| 0)) InVars {~A~0.base=v_~A~0.base_122, ~A~0.offset=v_~A~0.offset_122, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_82|, #memory_int=|v_#memory_int_217|, ~N~0=v_~N~0_107, ~min1~0=v_~min1~0_127} OutVars{~A~0.base=v_~A~0.base_122, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_15|, ~A~0.offset=v_~A~0.offset_122, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_45|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_81|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_53|, #memory_int=|v_#memory_int_217|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_15|, ~N~0=v_~N~0_107, ~min1~0=v_~min1~0_126} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:02,887 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [577] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_71 1) (= |v_thread1Thread1of1ForFork1_#res.offset_15| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_71 v_~N~0_107)) (let ((.cse0 (select (select |v_#memory_int_217| v_~A~0.base_122) (+ v_~A~0.offset_122 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_71 4))))) (let ((.cse1 (< .cse0 v_~min1~0_127))) (or (and (= v_~min1~0_126 .cse0) .cse1) (and (= |v_thread1Thread1of1ForFork1_#t~mem3_82| |v_thread1Thread1of1ForFork1_#t~mem3_81|) (= v_~min1~0_127 v_~min1~0_126) (not .cse1))))) (< v_thread1Thread1of1ForFork1_~i~0_71 (+ v_~N~0_107 1)) (= |v_thread1Thread1of1ForFork1_#res.base_15| 0)) InVars {~A~0.base=v_~A~0.base_122, ~A~0.offset=v_~A~0.offset_122, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_82|, #memory_int=|v_#memory_int_217|, ~N~0=v_~N~0_107, ~min1~0=v_~min1~0_127} OutVars{~A~0.base=v_~A~0.base_122, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_15|, ~A~0.offset=v_~A~0.offset_122, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_45|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_81|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_53|, #memory_int=|v_#memory_int_217|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_71, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_15|, ~N~0=v_~N~0_107, ~min1~0=v_~min1~0_126} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, ~min1~0] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:36:02,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:03,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] [2022-12-06 05:36:06,368 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:36:06,369 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4592 [2022-12-06 05:36:06,369 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 121 transitions, 1053 flow [2022-12-06 05:36:06,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 17 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:06,369 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:06,369 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:06,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:36:06,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:06,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:06,574 INFO L85 PathProgramCache]: Analyzing trace with hash -336026674, now seen corresponding path program 1 times [2022-12-06 05:36:06,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:06,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726520962] [2022-12-06 05:36:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:06,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:36:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:06,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726520962] [2022-12-06 05:36:06,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726520962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:06,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:06,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:06,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3789507] [2022-12-06 05:36:06,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:06,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:06,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:06,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 45 [2022-12-06 05:36:06,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 121 transitions, 1053 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 05:36:06,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:06,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 45 [2022-12-06 05:36:06,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:06,905 INFO L130 PetriNetUnfolder]: 1261/2034 cut-off events. [2022-12-06 05:36:06,906 INFO L131 PetriNetUnfolder]: For 7247/7368 co-relation queries the response was YES. [2022-12-06 05:36:06,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8765 conditions, 2034 events. 1261/2034 cut-off events. For 7247/7368 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10376 event pairs, 477 based on Foata normal form. 181/2203 useless extension candidates. Maximal degree in co-relation 8608. Up to 966 conditions per place. [2022-12-06 05:36:06,918 INFO L137 encePairwiseOnDemand]: 29/45 looper letters, 124 selfloop transitions, 11 changer transitions 3/148 dead transitions. [2022-12-06 05:36:06,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 148 transitions, 1525 flow [2022-12-06 05:36:06,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:06,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-06 05:36:06,919 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 05:36:06,919 INFO L175 Difference]: Start difference. First operand has 67 places, 121 transitions, 1053 flow. Second operand 4 states and 85 transitions. [2022-12-06 05:36:06,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 148 transitions, 1525 flow [2022-12-06 05:36:06,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 148 transitions, 1458 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-06 05:36:06,935 INFO L231 Difference]: Finished difference. Result has 67 places, 111 transitions, 958 flow [2022-12-06 05:36:06,936 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=958, PETRI_PLACES=67, PETRI_TRANSITIONS=111} [2022-12-06 05:36:06,937 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2022-12-06 05:36:06,938 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:06,938 INFO L89 Accepts]: Start accepts. Operand has 67 places, 111 transitions, 958 flow [2022-12-06 05:36:06,939 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:06,939 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:06,939 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 111 transitions, 958 flow [2022-12-06 05:36:06,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 111 transitions, 958 flow [2022-12-06 05:36:07,004 INFO L130 PetriNetUnfolder]: 455/1037 cut-off events. [2022-12-06 05:36:07,004 INFO L131 PetriNetUnfolder]: For 2420/2464 co-relation queries the response was YES. [2022-12-06 05:36:07,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3777 conditions, 1037 events. 455/1037 cut-off events. For 2420/2464 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6821 event pairs, 111 based on Foata normal form. 12/1000 useless extension candidates. Maximal degree in co-relation 3708. Up to 345 conditions per place. [2022-12-06 05:36:07,012 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 111 transitions, 958 flow [2022-12-06 05:36:07,012 INFO L188 LiptonReduction]: Number of co-enabled transitions 620 [2022-12-06 05:36:07,182 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L70-4-->L46-4: Formula: (and (= |v_thread3Thread1of1ForFork0_#res.offset_27| 0) (= 0 |v_thread3Thread1of1ForFork0_#res.base_27|) (not (< v_thread3Thread1of1ForFork0_~i~2_49 v_~N~0_91)) (= v_thread1Thread1of1ForFork1_~i~0_51 1) (let ((.cse1 (select (select |v_#memory_int_199| v_~A~0.base_106) (+ v_~A~0.offset_106 (- 4) (* v_thread1Thread1of1ForFork1_~i~0_51 4))))) (let ((.cse0 (< .cse1 v_~min1~0_93))) (or (and .cse0 (= v_~min1~0_92 .cse1)) (and (= v_~min1~0_93 v_~min1~0_92) (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_47| |v_thread1Thread1of1ForFork1_#t~mem3_46|))))) (< v_thread1Thread1of1ForFork1_~i~0_51 (+ 1 v_~N~0_91))) InVars {~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_47|, #memory_int=|v_#memory_int_199|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_49, ~N~0=v_~N~0_91, ~min1~0=v_~min1~0_93} OutVars{~A~0.base=v_~A~0.base_106, ~A~0.offset=v_~A~0.offset_106, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_25|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_46|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_33|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_27|, #memory_int=|v_#memory_int_199|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_49, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_51, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_27|, ~N~0=v_~N~0_91, ~min1~0=v_~min1~0_92} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork1_~i~0, thread3Thread1of1ForFork0_#res.base, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:36:07,327 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:36:07,328 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 390 [2022-12-06 05:36:07,328 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 111 transitions, 986 flow [2022-12-06 05:36:07,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 05:36:07,328 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:07,328 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:07,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:36:07,328 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1691480028, now seen corresponding path program 1 times [2022-12-06 05:36:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:07,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230851796] [2022-12-06 05:36:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:07,404 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 05:36:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:07,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230851796] [2022-12-06 05:36:07,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230851796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:07,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:07,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:36:07,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539452814] [2022-12-06 05:36:07,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:07,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:36:07,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:36:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:36:07,406 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-06 05:36:07,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 111 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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 05:36:07,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:07,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-06 05:36:07,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:07,710 INFO L130 PetriNetUnfolder]: 1169/1883 cut-off events. [2022-12-06 05:36:07,710 INFO L131 PetriNetUnfolder]: For 5978/5978 co-relation queries the response was YES. [2022-12-06 05:36:07,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7877 conditions, 1883 events. 1169/1883 cut-off events. For 5978/5978 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8910 event pairs, 392 based on Foata normal form. 118/1999 useless extension candidates. Maximal degree in co-relation 7719. Up to 994 conditions per place. [2022-12-06 05:36:07,719 INFO L137 encePairwiseOnDemand]: 31/41 looper letters, 137 selfloop transitions, 12 changer transitions 9/158 dead transitions. [2022-12-06 05:36:07,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 158 transitions, 1544 flow [2022-12-06 05:36:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:36:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:36:07,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 05:36:07,721 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3780487804878049 [2022-12-06 05:36:07,721 INFO L175 Difference]: Start difference. First operand has 67 places, 111 transitions, 986 flow. Second operand 6 states and 93 transitions. [2022-12-06 05:36:07,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 158 transitions, 1544 flow [2022-12-06 05:36:07,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 158 transitions, 1543 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:36:07,733 INFO L231 Difference]: Finished difference. Result has 75 places, 91 transitions, 801 flow [2022-12-06 05:36:07,733 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=75, PETRI_TRANSITIONS=91} [2022-12-06 05:36:07,733 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2022-12-06 05:36:07,734 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:07,734 INFO L89 Accepts]: Start accepts. Operand has 75 places, 91 transitions, 801 flow [2022-12-06 05:36:07,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:07,736 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:07,736 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 91 transitions, 801 flow [2022-12-06 05:36:07,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 91 transitions, 801 flow [2022-12-06 05:36:07,773 INFO L130 PetriNetUnfolder]: 269/649 cut-off events. [2022-12-06 05:36:07,773 INFO L131 PetriNetUnfolder]: For 1875/1937 co-relation queries the response was YES. [2022-12-06 05:36:07,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 649 events. 269/649 cut-off events. For 1875/1937 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3969 event pairs, 89 based on Foata normal form. 41/654 useless extension candidates. Maximal degree in co-relation 2310. Up to 247 conditions per place. [2022-12-06 05:36:07,777 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 91 transitions, 801 flow [2022-12-06 05:36:07,777 INFO L188 LiptonReduction]: Number of co-enabled transitions 522 [2022-12-06 05:36:07,783 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:07,783 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,051 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,051 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,246 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,247 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,409 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,409 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,572 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,572 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,760 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,760 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:08,932 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:36:08,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1199 [2022-12-06 05:36:08,933 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 89 transitions, 797 flow [2022-12-06 05:36:08,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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 05:36:08,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:08,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:08,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:36:08,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:08,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1361356705, now seen corresponding path program 1 times [2022-12-06 05:36:08,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:08,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310744749] [2022-12-06 05:36:08,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:08,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:09,103 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 05:36:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310744749] [2022-12-06 05:36:09,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310744749] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:09,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:09,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:36:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004471471] [2022-12-06 05:36:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:09,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:36:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:09,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:36:09,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:36:09,105 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:36:09,105 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 89 transitions, 797 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 05:36:09,105 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:09,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:36:09,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:09,300 INFO L130 PetriNetUnfolder]: 903/1467 cut-off events. [2022-12-06 05:36:09,301 INFO L131 PetriNetUnfolder]: For 5299/5361 co-relation queries the response was YES. [2022-12-06 05:36:09,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6721 conditions, 1467 events. 903/1467 cut-off events. For 5299/5361 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6835 event pairs, 100 based on Foata normal form. 60/1517 useless extension candidates. Maximal degree in co-relation 6661. Up to 832 conditions per place. [2022-12-06 05:36:09,308 INFO L137 encePairwiseOnDemand]: 27/39 looper letters, 84 selfloop transitions, 25 changer transitions 0/114 dead transitions. [2022-12-06 05:36:09,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 114 transitions, 1141 flow [2022-12-06 05:36:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:36:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:36:09,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-12-06 05:36:09,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3282051282051282 [2022-12-06 05:36:09,310 INFO L175 Difference]: Start difference. First operand has 68 places, 89 transitions, 797 flow. Second operand 5 states and 64 transitions. [2022-12-06 05:36:09,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 114 transitions, 1141 flow [2022-12-06 05:36:09,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 114 transitions, 1133 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-06 05:36:09,324 INFO L231 Difference]: Finished difference. Result has 68 places, 88 transitions, 821 flow [2022-12-06 05:36:09,324 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=821, PETRI_PLACES=68, PETRI_TRANSITIONS=88} [2022-12-06 05:36:09,326 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2022-12-06 05:36:09,326 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:09,326 INFO L89 Accepts]: Start accepts. Operand has 68 places, 88 transitions, 821 flow [2022-12-06 05:36:09,327 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:09,327 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:09,327 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 88 transitions, 821 flow [2022-12-06 05:36:09,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 88 transitions, 821 flow [2022-12-06 05:36:09,366 INFO L130 PetriNetUnfolder]: 296/716 cut-off events. [2022-12-06 05:36:09,366 INFO L131 PetriNetUnfolder]: For 2195/2236 co-relation queries the response was YES. [2022-12-06 05:36:09,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 716 events. 296/716 cut-off events. For 2195/2236 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4370 event pairs, 82 based on Foata normal form. 12/704 useless extension candidates. Maximal degree in co-relation 2492. Up to 251 conditions per place. [2022-12-06 05:36:09,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 88 transitions, 821 flow [2022-12-06 05:36:09,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 484 [2022-12-06 05:36:09,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:09,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 05:36:09,373 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 88 transitions, 821 flow [2022-12-06 05:36:09,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 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 05:36:09,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:09,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:09,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:36:09,373 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:09,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:09,374 INFO L85 PathProgramCache]: Analyzing trace with hash 405688788, now seen corresponding path program 1 times [2022-12-06 05:36:09,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:09,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738968956] [2022-12-06 05:36:09,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:09,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:36:09,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:09,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738968956] [2022-12-06 05:36:09,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738968956] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:09,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:09,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435631044] [2022-12-06 05:36:09,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:09,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:09,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:09,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:09,421 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 38 [2022-12-06 05:36:09,422 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 88 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 05:36:09,422 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:09,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 38 [2022-12-06 05:36:09,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:09,607 INFO L130 PetriNetUnfolder]: 895/1467 cut-off events. [2022-12-06 05:36:09,607 INFO L131 PetriNetUnfolder]: For 6196/6312 co-relation queries the response was YES. [2022-12-06 05:36:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6811 conditions, 1467 events. 895/1467 cut-off events. For 6196/6312 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7094 event pairs, 358 based on Foata normal form. 157/1606 useless extension candidates. Maximal degree in co-relation 6192. Up to 682 conditions per place. [2022-12-06 05:36:09,619 INFO L137 encePairwiseOnDemand]: 30/38 looper letters, 92 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2022-12-06 05:36:09,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 1217 flow [2022-12-06 05:36:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:36:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:36:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 05:36:09,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:36:09,620 INFO L175 Difference]: Start difference. First operand has 68 places, 88 transitions, 821 flow. Second operand 4 states and 76 transitions. [2022-12-06 05:36:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 1217 flow [2022-12-06 05:36:09,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 118 transitions, 1165 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:36:09,632 INFO L231 Difference]: Finished difference. Result has 66 places, 85 transitions, 792 flow [2022-12-06 05:36:09,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=792, PETRI_PLACES=66, PETRI_TRANSITIONS=85} [2022-12-06 05:36:09,633 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 36 predicate places. [2022-12-06 05:36:09,633 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:09,633 INFO L89 Accepts]: Start accepts. Operand has 66 places, 85 transitions, 792 flow [2022-12-06 05:36:09,634 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:09,634 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:09,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 85 transitions, 792 flow [2022-12-06 05:36:09,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 85 transitions, 792 flow [2022-12-06 05:36:09,696 INFO L130 PetriNetUnfolder]: 337/745 cut-off events. [2022-12-06 05:36:09,696 INFO L131 PetriNetUnfolder]: For 2404/2440 co-relation queries the response was YES. [2022-12-06 05:36:09,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 745 events. 337/745 cut-off events. For 2404/2440 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4368 event pairs, 95 based on Foata normal form. 12/726 useless extension candidates. Maximal degree in co-relation 2809. Up to 293 conditions per place. [2022-12-06 05:36:09,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 85 transitions, 792 flow [2022-12-06 05:36:09,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 05:36:09,702 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:09,704 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 05:36:09,704 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 85 transitions, 792 flow [2022-12-06 05:36:09,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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 05:36:09,704 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:09,704 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:09,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:36:09,704 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1942874145, now seen corresponding path program 1 times [2022-12-06 05:36:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:09,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315321958] [2022-12-06 05:36:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:09,790 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 05:36:09,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:09,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315321958] [2022-12-06 05:36:09,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315321958] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:09,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:09,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:36:09,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674684388] [2022-12-06 05:36:09,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:09,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:36:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:09,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:36:09,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:36:09,792 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:36:09,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 85 transitions, 792 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 05:36:09,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:09,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:36:09,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:09,974 INFO L130 PetriNetUnfolder]: 928/1504 cut-off events. [2022-12-06 05:36:09,974 INFO L131 PetriNetUnfolder]: For 6744/6813 co-relation queries the response was YES. [2022-12-06 05:36:09,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7312 conditions, 1504 events. 928/1504 cut-off events. For 6744/6813 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7027 event pairs, 294 based on Foata normal form. 106/1600 useless extension candidates. Maximal degree in co-relation 6706. Up to 646 conditions per place. [2022-12-06 05:36:09,986 INFO L137 encePairwiseOnDemand]: 24/37 looper letters, 91 selfloop transitions, 15 changer transitions 11/122 dead transitions. [2022-12-06 05:36:09,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 122 transitions, 1218 flow [2022-12-06 05:36:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:36:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:36:09,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 05:36:09,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42162162162162165 [2022-12-06 05:36:09,987 INFO L175 Difference]: Start difference. First operand has 66 places, 85 transitions, 792 flow. Second operand 5 states and 78 transitions. [2022-12-06 05:36:09,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 122 transitions, 1218 flow [2022-12-06 05:36:09,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 122 transitions, 1191 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 05:36:10,001 INFO L231 Difference]: Finished difference. Result has 69 places, 72 transitions, 702 flow [2022-12-06 05:36:10,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=69, PETRI_TRANSITIONS=72} [2022-12-06 05:36:10,003 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 39 predicate places. [2022-12-06 05:36:10,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:10,003 INFO L89 Accepts]: Start accepts. Operand has 69 places, 72 transitions, 702 flow [2022-12-06 05:36:10,004 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:10,004 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:10,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 72 transitions, 702 flow [2022-12-06 05:36:10,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 72 transitions, 702 flow [2022-12-06 05:36:10,043 INFO L130 PetriNetUnfolder]: 297/675 cut-off events. [2022-12-06 05:36:10,043 INFO L131 PetriNetUnfolder]: For 2671/2698 co-relation queries the response was YES. [2022-12-06 05:36:10,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 675 events. 297/675 cut-off events. For 2671/2698 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3929 event pairs, 84 based on Foata normal form. 6/650 useless extension candidates. Maximal degree in co-relation 2741. Up to 280 conditions per place. [2022-12-06 05:36:10,048 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 72 transitions, 702 flow [2022-12-06 05:36:10,048 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 05:36:10,048 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:10,049 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-06 05:36:10,049 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 702 flow [2022-12-06 05:36:10,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 05:36:10,049 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:10,049 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:10,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:36:10,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:10,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1507551892, now seen corresponding path program 1 times [2022-12-06 05:36:10,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:10,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340280881] [2022-12-06 05:36:10,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:36:10,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:10,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340280881] [2022-12-06 05:36:10,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340280881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:36:10,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:36:10,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:36:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959484297] [2022-12-06 05:36:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:36:10,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:36:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:10,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:36:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:36:10,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 31 [2022-12-06 05:36:10,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 702 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 05:36:10,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:10,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 31 [2022-12-06 05:36:10,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:10,413 INFO L130 PetriNetUnfolder]: 792/1284 cut-off events. [2022-12-06 05:36:10,413 INFO L131 PetriNetUnfolder]: For 6284/6341 co-relation queries the response was YES. [2022-12-06 05:36:10,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 1284 events. 792/1284 cut-off events. For 6284/6341 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5728 event pairs, 264 based on Foata normal form. 78/1353 useless extension candidates. Maximal degree in co-relation 6004. Up to 646 conditions per place. [2022-12-06 05:36:10,420 INFO L137 encePairwiseOnDemand]: 22/31 looper letters, 84 selfloop transitions, 15 changer transitions 9/113 dead transitions. [2022-12-06 05:36:10,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 113 transitions, 1083 flow [2022-12-06 05:36:10,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:36:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:36:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-12-06 05:36:10,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2022-12-06 05:36:10,421 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 702 flow. Second operand 6 states and 80 transitions. [2022-12-06 05:36:10,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 113 transitions, 1083 flow [2022-12-06 05:36:10,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 113 transitions, 1065 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:10,430 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 619 flow [2022-12-06 05:36:10,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2022-12-06 05:36:10,430 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 42 predicate places. [2022-12-06 05:36:10,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:10,430 INFO L89 Accepts]: Start accepts. Operand has 72 places, 63 transitions, 619 flow [2022-12-06 05:36:10,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:10,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:10,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 63 transitions, 619 flow [2022-12-06 05:36:10,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 63 transitions, 619 flow [2022-12-06 05:36:10,464 INFO L130 PetriNetUnfolder]: 259/559 cut-off events. [2022-12-06 05:36:10,464 INFO L131 PetriNetUnfolder]: For 2939/2960 co-relation queries the response was YES. [2022-12-06 05:36:10,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 559 events. 259/559 cut-off events. For 2939/2960 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2962 event pairs, 73 based on Foata normal form. 6/538 useless extension candidates. Maximal degree in co-relation 2587. Up to 247 conditions per place. [2022-12-06 05:36:10,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 63 transitions, 619 flow [2022-12-06 05:36:10,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-06 05:36:10,469 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:36:10,471 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 05:36:10,471 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 619 flow [2022-12-06 05:36:10,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 05:36:10,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:10,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:10,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:36:10,472 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1519410157, now seen corresponding path program 2 times [2022-12-06 05:36:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357569834] [2022-12-06 05:36:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:10,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:11,448 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 05:36:11,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357569834] [2022-12-06 05:36:11,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357569834] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:11,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860916742] [2022-12-06 05:36:11,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:36:11,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:11,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:11,450 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 05:36:11,452 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 05:36:11,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:36:11,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:36:11,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-06 05:36:11,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:11,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-06 05:36:11,638 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 05:36:11,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:36:11,749 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 50 treesize of output 48 [2022-12-06 05:36:11,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:36:11,937 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 35 treesize of output 33 [2022-12-06 05:36:12,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 05:36:12,132 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:36:12,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 39 [2022-12-06 05:36:12,166 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 05:36:12,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:12,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~min2~0 c_~min1~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~A~0.base) .cse1))) (or (< .cse0 c_~min2~0) (not (< .cse0 c_~min3~0))))) .cse2) (forall ((v_ArrVal_362 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~A~0.base) .cse1))) (or (<= c_~min2~0 .cse3) (not (< .cse3 c_~min3~0)) (= c_~min1~0 .cse3)))) (or (and (or (<= c_~min2~0 c_~min3~0) (= c_~min1~0 c_~min3~0)) (or .cse2 (< c_~min3~0 c_~min2~0))) (forall ((v_ArrVal_362 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_362) c_~A~0.base) .cse1) c_~min3~0))))) is different from false [2022-12-06 05:36:12,944 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 05:36:12,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860916742] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:12,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:12,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2022-12-06 05:36:12,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984054627] [2022-12-06 05:36:12,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:12,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:36:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:36:12,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=434, Unknown=2, NotChecked=42, Total=552 [2022-12-06 05:36:12,946 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:36:12,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 619 flow. Second operand has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:12,946 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:12,946 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:36:12,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:18,223 INFO L130 PetriNetUnfolder]: 1249/1952 cut-off events. [2022-12-06 05:36:18,223 INFO L131 PetriNetUnfolder]: For 8855/8855 co-relation queries the response was YES. [2022-12-06 05:36:18,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9782 conditions, 1952 events. 1249/1952 cut-off events. For 8855/8855 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8891 event pairs, 104 based on Foata normal form. 2/1951 useless extension candidates. Maximal degree in co-relation 9157. Up to 1304 conditions per place. [2022-12-06 05:36:18,232 INFO L137 encePairwiseOnDemand]: 10/30 looper letters, 128 selfloop transitions, 81 changer transitions 51/260 dead transitions. [2022-12-06 05:36:18,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 260 transitions, 2420 flow [2022-12-06 05:36:18,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 05:36:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 05:36:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 211 transitions. [2022-12-06 05:36:18,234 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30579710144927535 [2022-12-06 05:36:18,234 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 619 flow. Second operand 23 states and 211 transitions. [2022-12-06 05:36:18,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 260 transitions, 2420 flow [2022-12-06 05:36:18,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 260 transitions, 2352 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:18,251 INFO L231 Difference]: Finished difference. Result has 100 places, 128 transitions, 1467 flow [2022-12-06 05:36:18,251 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1467, PETRI_PLACES=100, PETRI_TRANSITIONS=128} [2022-12-06 05:36:18,251 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2022-12-06 05:36:18,251 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:18,251 INFO L89 Accepts]: Start accepts. Operand has 100 places, 128 transitions, 1467 flow [2022-12-06 05:36:18,252 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:18,252 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:18,252 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 128 transitions, 1467 flow [2022-12-06 05:36:18,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 128 transitions, 1467 flow [2022-12-06 05:36:18,312 INFO L130 PetriNetUnfolder]: 497/947 cut-off events. [2022-12-06 05:36:18,313 INFO L131 PetriNetUnfolder]: For 5846/6125 co-relation queries the response was YES. [2022-12-06 05:36:18,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5132 conditions, 947 events. 497/947 cut-off events. For 5846/6125 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5289 event pairs, 159 based on Foata normal form. 37/903 useless extension candidates. Maximal degree in co-relation 4852. Up to 389 conditions per place. [2022-12-06 05:36:18,322 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 128 transitions, 1467 flow [2022-12-06 05:36:18,322 INFO L188 LiptonReduction]: Number of co-enabled transitions 590 [2022-12-06 05:36:18,338 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:36:18,635 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:18,635 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:18,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L93-4-->L94-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_122|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_59|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_13|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:36:18,963 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] L93-4-->L94-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_122|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_59|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_13|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:36:19,069 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:19,172 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,172 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:19,409 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] [2022-12-06 05:36:19,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [604] L46-4-->L70-4: Formula: (let ((.cse2 (select |v_#memory_int_272| v_~A~0.base_162))) (and (< v_thread1Thread1of1ForFork1_~i~0_100 v_~N~0_145) (< v_thread3Thread1of1ForFork0_~i~2_137 v_~N~0_145) (let ((.cse0 (select .cse2 (+ v_~A~0.offset_162 (* v_thread3Thread1of1ForFork0_~i~2_137 4))))) (let ((.cse1 (< .cse0 v_~min3~0_134))) (or (and (= .cse0 v_~min3~0_133) .cse1) (and (= v_~min3~0_134 v_~min3~0_133) (not .cse1) (= |v_thread3Thread1of1ForFork0_#t~mem9_88| |v_thread3Thread1of1ForFork0_#t~mem9_87|))))) (= v_thread1Thread1of1ForFork1_~i~0_99 (+ v_thread1Thread1of1ForFork1_~i~0_100 1)) (let ((.cse4 (select .cse2 (+ (* v_thread1Thread1of1ForFork1_~i~0_100 4) v_~A~0.offset_162)))) (let ((.cse3 (< .cse4 v_~min1~0_165))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_117| |v_thread1Thread1of1ForFork1_#t~mem3_116|) (not .cse3) (= v_~min1~0_165 v_~min1~0_164)) (and .cse3 (= v_~min1~0_164 .cse4))))) (= (+ v_thread3Thread1of1ForFork0_~i~2_137 1) v_thread3Thread1of1ForFork0_~i~2_136))) InVars {~A~0.base=v_~A~0.base_162, ~A~0.offset=v_~A~0.offset_162, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_117|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_137, #memory_int=|v_#memory_int_272|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_88|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_100, ~N~0=v_~N~0_145, ~min1~0=v_~min1~0_165, ~min3~0=v_~min3~0_134} OutVars{~A~0.base=v_~A~0.base_162, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_136, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_87|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_99, ~N~0=v_~N~0_145, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_53|, ~A~0.offset=v_~A~0.offset_162, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_63|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_116|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_71|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_61|, #memory_int=|v_#memory_int_272|, ~min1~0=v_~min1~0_164, ~min3~0=v_~min3~0_133} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] and [539] L46-4-->L46-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_140| v_~A~0.base_71) (+ v_~A~0.offset_71 (* v_thread1Thread1of1ForFork1_~i~0_30 4))))) (let ((.cse0 (< .cse1 v_~min1~0_57))) (or (and (= |v_thread1Thread1of1ForFork1_#t~mem3_24| |v_thread1Thread1of1ForFork1_#t~mem3_23|) (not .cse0) (= v_~min1~0_57 v_~min1~0_56)) (and (= v_~min1~0_56 .cse1) .cse0)))) (< v_thread1Thread1of1ForFork1_~i~0_30 v_~N~0_51) (= v_thread1Thread1of1ForFork1_~i~0_29 (+ v_thread1Thread1of1ForFork1_~i~0_30 1))) InVars {~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_24|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_30, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_57} OutVars{~A~0.base=v_~A~0.base_71, ~A~0.offset=v_~A~0.offset_71, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_13|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_23|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_21|, #memory_int=|v_#memory_int_140|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29, ~N~0=v_~N~0_51, ~min1~0=v_~min1~0_56} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] [2022-12-06 05:36:19,444 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,444 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,444 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,444 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,691 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,691 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,692 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,692 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,991 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,992 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,992 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:19,992 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:20,232 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [544] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre15#1_29|)) |v_#memory_int_148|) (= |v_ULTIMATE.start_main_#t~pre15#1_29| |v_#pthreadsForks_63|) (= |v_#pthreadsForks_62| (+ |v_#pthreadsForks_63| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 05:36:20,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [550] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_Out_4| 0) (not (< v_thread2Thread1of1ForFork2_~i~1_In_3 v_~M~0_In_4)) (= |v_thread2Thread1of1ForFork2_#res.base_Out_4| 0)) InVars {~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_In_3, thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_Out_4|, ~M~0=v_~M~0_In_4, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:20,369 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] and [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] [2022-12-06 05:36:23,459 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 05:36:23,460 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5209 [2022-12-06 05:36:23,460 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 123 transitions, 1510 flow [2022-12-06 05:36:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:23,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:36:23,461 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:36:23,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:36:23,681 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 05:36:23,682 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:36:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:36:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -137558873, now seen corresponding path program 1 times [2022-12-06 05:36:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:36:23,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276852689] [2022-12-06 05:36:23,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:36:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:24,473 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 05:36:24,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:36:24,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276852689] [2022-12-06 05:36:24,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276852689] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:36:24,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920779365] [2022-12-06 05:36:24,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:36:24,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:36:24,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:24,476 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 05:36:24,541 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 05:36:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:36:24,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:36:24,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:36:24,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:36:24,662 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 53 treesize of output 51 [2022-12-06 05:36:24,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:36:24,725 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 50 treesize of output 48 [2022-12-06 05:36:24,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:36:24,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 50 [2022-12-06 05:36:25,225 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 05:36:25,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:36:25,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:36:25,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 496 treesize of output 502 [2022-12-06 05:36:25,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 413 treesize of output 377 [2022-12-06 05:36:25,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:36:25,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 377 treesize of output 378 [2022-12-06 05:36:25,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 317 [2022-12-06 05:36:25,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 305 [2022-12-06 05:36:32,764 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 05:36:32,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920779365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:36:32,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:36:32,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2022-12-06 05:36:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653610243] [2022-12-06 05:36:32,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:36:32,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-06 05:36:32,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:36:32,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-06 05:36:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=353, Unknown=4, NotChecked=0, Total=462 [2022-12-06 05:36:32,765 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 46 [2022-12-06 05:36:32,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 123 transitions, 1510 flow. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:36:32,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:36:32,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 46 [2022-12-06 05:36:32,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:36:34,490 INFO L130 PetriNetUnfolder]: 1281/2035 cut-off events. [2022-12-06 05:36:34,491 INFO L131 PetriNetUnfolder]: For 15978/16078 co-relation queries the response was YES. [2022-12-06 05:36:34,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13091 conditions, 2035 events. 1281/2035 cut-off events. For 15978/16078 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9898 event pairs, 195 based on Foata normal form. 60/2070 useless extension candidates. Maximal degree in co-relation 12179. Up to 1139 conditions per place. [2022-12-06 05:36:34,503 INFO L137 encePairwiseOnDemand]: 17/46 looper letters, 162 selfloop transitions, 109 changer transitions 33/311 dead transitions. [2022-12-06 05:36:34,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 311 transitions, 3601 flow [2022-12-06 05:36:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 05:36:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 05:36:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 245 transitions. [2022-12-06 05:36:34,504 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.24209486166007904 [2022-12-06 05:36:34,505 INFO L175 Difference]: Start difference. First operand has 92 places, 123 transitions, 1510 flow. Second operand 22 states and 245 transitions. [2022-12-06 05:36:34,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 311 transitions, 3601 flow [2022-12-06 05:36:34,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 311 transitions, 3245 flow, removed 172 selfloop flow, removed 3 redundant places. [2022-12-06 05:36:34,537 INFO L231 Difference]: Finished difference. Result has 117 places, 176 transitions, 2221 flow [2022-12-06 05:36:34,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2221, PETRI_PLACES=117, PETRI_TRANSITIONS=176} [2022-12-06 05:36:34,538 INFO L294 CegarLoopForPetriNet]: 30 programPoint places, 87 predicate places. [2022-12-06 05:36:34,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:36:34,538 INFO L89 Accepts]: Start accepts. Operand has 117 places, 176 transitions, 2221 flow [2022-12-06 05:36:34,539 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:36:34,539 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:34,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 176 transitions, 2221 flow [2022-12-06 05:36:34,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 176 transitions, 2221 flow [2022-12-06 05:36:34,628 INFO L130 PetriNetUnfolder]: 686/1291 cut-off events. [2022-12-06 05:36:34,628 INFO L131 PetriNetUnfolder]: For 9681/9931 co-relation queries the response was YES. [2022-12-06 05:36:34,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7513 conditions, 1291 events. 686/1291 cut-off events. For 9681/9931 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7457 event pairs, 205 based on Foata normal form. 34/1252 useless extension candidates. Maximal degree in co-relation 7474. Up to 437 conditions per place. [2022-12-06 05:36:34,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 176 transitions, 2221 flow [2022-12-06 05:36:34,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-06 05:36:34,640 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:36:34,699 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:34,806 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:34,912 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [549] L70-4-->thread3EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork0_~i~2_In_3 v_~N~0_In_6)) (= |v_thread3Thread1of1ForFork0_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork0_#res.base_Out_4| 0)) InVars {thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, ~N~0=v_~N~0_In_6} OutVars{thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_In_3, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_Out_4|, ~N~0=v_~N~0_In_6, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base] and [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:36:34,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [551] L97-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_32| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| (ite (not (= v_~min1~0_In_5 (ite (< v_~min3~0_In_5 v_~min2~0_In_5) v_~min3~0_In_5 v_~min2~0_In_5))) 1 0)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_32|)) InVars {~min1~0=v_~min1~0_In_5, ~min2~0=v_~min2~0_In_5, ~min3~0=v_~min3~0_In_5} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_Out_32|, ~min1~0=v_~min1~0_In_5, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_Out_8|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_Out_22|, ~min2~0=v_~min2~0_In_5, ~min3~0=v_~min3~0_In_5} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [554] L46-4-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.offset_Out_4| 0) (= |v_thread1Thread1of1ForFork1_#res.base_Out_4| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_In_3 v_~N~0_In_8))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, ~N~0=v_~N~0_In_8} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_In_3, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_Out_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_Out_4|, ~N~0=v_~N~0_In_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:36:35,023 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [608] L46-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_69 0) (= |v_thread1Thread1of1ForFork1_#res.base_31| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_31| 0) (not (< v_thread1Thread1of1ForFork1_~i~0_111 v_~N~0_151))) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_111, ~N~0=v_~N~0_151} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_69, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_31|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_111, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_31|, ~N~0=v_~N~0_151} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] [2022-12-06 05:36:35,049 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [407] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork0_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_~i~2] and [397] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork2_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_~i~1] [2022-12-06 05:36:35,066 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:35,177 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:36:35,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [527] L93-4-->L94-3: Formula: (and (= (store |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23| (store (select |v_#memory_int_123| |v_ULTIMATE.start_main_~#t3~0#1.base_23|) |v_ULTIMATE.start_main_~#t3~0#1.offset_23| |v_ULTIMATE.start_main_#t~pre17#1_27|)) |v_#memory_int_122|) (= |v_#pthreadsForks_58| (+ |v_#pthreadsForks_59| 1)) (= |v_ULTIMATE.start_main_#t~pre17#1_27| |v_#pthreadsForks_59|)) InVars {#pthreadsForks=|v_#pthreadsForks_59|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_123|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_13|, #pthreadsForks=|v_#pthreadsForks_58|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_23|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_23|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_21|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 05:36:35,352 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [525] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_118| v_~A~0.base_63) (+ (* 4 v_thread3Thread1of1ForFork0_~i~2_30) v_~A~0.offset_63)))) (let ((.cse0 (< .cse1 v_~min3~0_41))) (or (and (not .cse0) (= |v_thread3Thread1of1ForFork0_#t~mem9_12| |v_thread3Thread1of1ForFork0_#t~mem9_11|) (= v_~min3~0_41 v_~min3~0_40)) (and (= v_~min3~0_40 .cse1) .cse0)))) (= (+ v_thread3Thread1of1ForFork0_~i~2_30 1) v_thread3Thread1of1ForFork0_~i~2_29) (< v_thread3Thread1of1ForFork0_~i~2_30 v_~N~0_39)) InVars {~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_30, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_12|, ~N~0=v_~N~0_39, ~min3~0=v_~min3~0_41} OutVars{~A~0.base=v_~A~0.base_63, ~A~0.offset=v_~A~0.offset_63, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_15|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_29, #memory_int=|v_#memory_int_118|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_11|, ~N~0=v_~N~0_39, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_7|, ~min3~0=v_~min3~0_40} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:35,466 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [544] L92-3-->L93-3: Formula: (and (= (store |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_149| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre15#1_29|)) |v_#memory_int_148|) (= |v_ULTIMATE.start_main_#t~pre15#1_29| |v_#pthreadsForks_63|) (= |v_#pthreadsForks_62| (+ |v_#pthreadsForks_63| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_63|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_37|, #pthreadsForks=|v_#pthreadsForks_62|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_148|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_29|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet14#1] [2022-12-06 05:36:35,546 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [558] $Ultimate##0-->L46-4: Formula: (and (< v_thread1Thread1of1ForFork1_~i~0_33 (+ 1 v_~N~0_73)) (let ((.cse1 (select (select |v_#memory_int_166| v_~A~0.base_85) (+ (- 4) v_~A~0.offset_85 (* v_thread1Thread1of1ForFork1_~i~0_33 4))))) (let ((.cse0 (< .cse1 v_~min1~0_71))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork1_#t~mem3_28| |v_thread1Thread1of1ForFork1_#t~mem3_27|) (= v_~min1~0_71 v_~min1~0_70)) (and .cse0 (= .cse1 v_~min1~0_70))))) (= v_thread1Thread1of1ForFork1_~i~0_33 1)) InVars {~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_28|, #memory_int=|v_#memory_int_166|, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_71} OutVars{~A~0.base=v_~A~0.base_85, ~A~0.offset=v_~A~0.offset_85, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_15|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_27|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_23|, #memory_int=|v_#memory_int_166|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33, ~N~0=v_~N~0_73, ~min1~0=v_~min1~0_70} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_~i~0, ~min1~0] and [478] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork2_~i~1_25 (+ v_thread2Thread1of1ForFork2_~i~1_26 1)) (< v_thread2Thread1of1ForFork2_~i~1_26 v_~M~0_13) (let ((.cse1 (select (select |v_#memory_int_84| v_~A~0.base_51) (+ (* 4 v_thread2Thread1of1ForFork2_~i~1_26) v_~A~0.offset_51)))) (let ((.cse0 (< .cse1 v_~min2~0_41))) (or (and .cse0 (= v_~min2~0_40 .cse1)) (and (not .cse0) (= |v_thread2Thread1of1ForFork2_#t~mem6_24| |v_thread2Thread1of1ForFork2_#t~mem6_23|) (= v_~min2~0_41 v_~min2~0_40)))))) InVars {thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_24|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_26, ~A~0.offset=v_~A~0.offset_51, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_41} OutVars{thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_19|, thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_23|, ~A~0.base=v_~A~0.base_51, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_25, ~A~0.offset=v_~A~0.offset_51, thread2Thread1of1ForFork2_#t~mem5=|v_thread2Thread1of1ForFork2_#t~mem5_13|, ~M~0=v_~M~0_13, #memory_int=|v_#memory_int_84|, ~min2~0=v_~min2~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post4, thread2Thread1of1ForFork2_#t~mem6, thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~mem5, ~min2~0] [2022-12-06 05:36:35,649 WARN L322 ript$VariableManager]: TermVariable LBE236 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:35,649 WARN L322 ript$VariableManager]: TermVariable LBE231 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:35,875 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] L46-4-->L70-4: Formula: (let ((.cse3 (* v_thread3Thread1of1ForFork0_~i~2_154 4)) (.cse2 (select |v_#memory_int_282| v_~A~0.base_172))) (and (let ((.cse0 (select .cse2 (+ v_~A~0.offset_172 .cse3)))) (let ((.cse1 (< .cse0 v_~min3~0_151))) (or (and (= .cse0 v_~min3~0_150) .cse1) (and (not .cse1) (= v_~min3~0_151 v_~min3~0_150) (= |v_thread3Thread1of1ForFork0_#t~mem9_105| |v_thread3Thread1of1ForFork0_#t~mem9_104|))))) (= v_thread3Thread1of1ForFork0_~i~2_152 (+ 2 v_thread3Thread1of1ForFork0_~i~2_154)) (= v_thread1Thread1of1ForFork1_~i~0_125 (+ v_thread1Thread1of1ForFork1_~i~0_126 1)) (let ((.cse4 (select .cse2 (+ v_~A~0.offset_172 .cse3 4)))) (let ((.cse5 (< .cse4 v_~min3~0_150))) (or (and (= v_~min3~0_149 .cse4) .cse5) (and (= |v_thread3Thread1of1ForFork0_#t~mem9_103| |v_thread3Thread1of1ForFork0_#t~mem9_104|) (= v_~min3~0_150 v_~min3~0_149) (not .cse5))))) (< (+ v_thread3Thread1of1ForFork0_~i~2_154 1) v_~N~0_157) (< v_thread1Thread1of1ForFork1_~i~0_126 v_~N~0_157) (let ((.cse7 (select .cse2 (+ v_~A~0.offset_172 (* v_thread1Thread1of1ForFork1_~i~0_126 4))))) (let ((.cse6 (< .cse7 v_~min1~0_187))) (or (and (not .cse6) (= v_~min1~0_187 v_~min1~0_186) (= |v_thread1Thread1of1ForFork1_#t~mem3_139| |v_thread1Thread1of1ForFork1_#t~mem3_138|)) (and (= v_~min1~0_186 .cse7) .cse6)))))) InVars {~A~0.base=v_~A~0.base_172, ~A~0.offset=v_~A~0.offset_172, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_139|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_154, #memory_int=|v_#memory_int_282|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_105|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_126, ~N~0=v_~N~0_157, ~min1~0=v_~min1~0_187, ~min3~0=v_~min3~0_151} OutVars{~A~0.base=v_~A~0.base_172, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_152, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_103|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_125, ~N~0=v_~N~0_157, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_61|, ~A~0.offset=v_~A~0.offset_172, thread1Thread1of1ForFork1_#t~mem2=|v_thread1Thread1of1ForFork1_#t~mem2_77|, thread1Thread1of1ForFork1_#t~mem3=|v_thread1Thread1of1ForFork1_#t~mem3_138|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_85|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_69|, #memory_int=|v_#memory_int_282|, ~min1~0=v_~min1~0_186, ~min3~0=v_~min3~0_149} AuxVars[v_~min3~0_150, |v_thread3Thread1of1ForFork0_#t~mem9_104|] AssignedVars[thread1Thread1of1ForFork1_#t~mem2, thread1Thread1of1ForFork1_#t~mem3, thread1Thread1of1ForFork1_#t~post1, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_~i~0, ~min1~0, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] and [622] L46-4-->L70-4: Formula: (and (not (< v_thread1Thread1of1ForFork1_~i~0_137 v_~N~0_171)) (= v_thread3Thread1of1ForFork0_~i~2_174 (+ v_thread3Thread1of1ForFork0_~i~2_175 1)) (< v_thread3Thread1of1ForFork0_~i~2_175 v_~N~0_171) (= |v_thread1Thread1of1ForFork1_#res.base_39| 0) (let ((.cse1 (select (select |v_#memory_int_308| v_~A~0.base_186) (+ (* v_thread3Thread1of1ForFork0_~i~2_175 4) v_~A~0.offset_186)))) (let ((.cse0 (< .cse1 v_~min3~0_170))) (or (and (= |v_thread3Thread1of1ForFork0_#t~mem9_121| |v_thread3Thread1of1ForFork0_#t~mem9_120|) (not .cse0) (= v_~min3~0_170 v_~min3~0_169)) (and .cse0 (= .cse1 v_~min3~0_169))))) (= |v_thread1Thread1of1ForFork1_#res.offset_39| 0)) InVars {~A~0.base=v_~A~0.base_186, ~A~0.offset=v_~A~0.offset_186, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_175, #memory_int=|v_#memory_int_308|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_121|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_137, ~N~0=v_~N~0_171, ~min3~0=v_~min3~0_170} OutVars{~A~0.base=v_~A~0.base_186, ~A~0.offset=v_~A~0.offset_186, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_39|, thread3Thread1of1ForFork0_#t~post7=|v_thread3Thread1of1ForFork0_#t~post7_79|, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_174, #memory_int=|v_#memory_int_308|, thread3Thread1of1ForFork0_#t~mem9=|v_thread3Thread1of1ForFork0_#t~mem9_120|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_137, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_39|, ~N~0=v_~N~0_171, thread3Thread1of1ForFork0_#t~mem8=|v_thread3Thread1of1ForFork0_#t~mem8_71|, ~min3~0=v_~min3~0_169} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork0_#t~post7, thread3Thread1of1ForFork0_~i~2, thread3Thread1of1ForFork0_#t~mem9, thread1Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork0_#t~mem8, ~min3~0] [2022-12-06 05:36:35,875 WARN L322 ript$VariableManager]: TermVariable LBE241 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:35,876 WARN L322 ript$VariableManager]: TermVariable LBE238 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:36:35,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 05:36:36,080 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 05:36:36,081 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread3Thread1of1ForFork0_#t~mem9_107 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) 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 05:36:36,083 INFO L158 Benchmark]: Toolchain (without parser) took 66944.60ms. Allocated memory was 211.8MB in the beginning and 601.9MB in the end (delta: 390.1MB). Free memory was 188.3MB in the beginning and 548.2MB in the end (delta: -359.9MB). Peak memory consumption was 367.3MB. Max. memory is 8.0GB. [2022-12-06 05:36:36,083 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 187.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:36:36,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.75ms. Allocated memory is still 211.8MB. Free memory was 187.8MB in the beginning and 175.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:36:36,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.03ms. Allocated memory is still 211.8MB. Free memory was 175.7MB in the beginning and 173.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:36,084 INFO L158 Benchmark]: Boogie Preprocessor took 45.95ms. Allocated memory is still 211.8MB. Free memory was 173.6MB in the beginning and 172.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:36:36,084 INFO L158 Benchmark]: RCFGBuilder took 519.94ms. Allocated memory is still 211.8MB. Free memory was 172.1MB in the beginning and 151.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 05:36:36,084 INFO L158 Benchmark]: TraceAbstraction took 66105.59ms. Allocated memory was 211.8MB in the beginning and 601.9MB in the end (delta: 390.1MB). Free memory was 151.1MB in the beginning and 548.2MB in the end (delta: -397.1MB). Peak memory consumption was 329.6MB. Max. memory is 8.0GB. [2022-12-06 05:36:36,087 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 211.8MB. Free memory is still 187.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.75ms. Allocated memory is still 211.8MB. Free memory was 187.8MB in the beginning and 175.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.03ms. Allocated memory is still 211.8MB. Free memory was 175.7MB in the beginning and 173.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.95ms. Allocated memory is still 211.8MB. Free memory was 173.6MB in the beginning and 172.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 519.94ms. Allocated memory is still 211.8MB. Free memory was 172.1MB in the beginning and 151.6MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 66105.59ms. Allocated memory was 211.8MB in the beginning and 601.9MB in the end (delta: 390.1MB). Free memory was 151.1MB in the beginning and 548.2MB in the end (delta: -397.1MB). Peak memory consumption was 329.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 127 PlacesBefore, 30 PlacesAfterwards, 129 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 67 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 105 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 670, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 674, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 674, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 674, unknown conditional: 0, unknown unconditional: 674] , Statistics on independence cache: Total cache size (in pairs): 1066, Positive cache size: 1062, Positive conditional cache size: 0, Positive unconditional cache size: 1062, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.1s, 27 PlacesBefore, 26 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 144 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.1s, 28 PlacesBefore, 27 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 2, independent unconditional: 9, 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: 2, independent unconditional: 9, 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: 11, independent: 11, independent conditional: 2, independent unconditional: 9, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 2, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 2, Positive unconditional cache size: 9, 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: 3.3s, 50 PlacesBefore, 48 PlacesAfterwards, 79 TransitionsBefore, 77 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 64, independent conditional: 64, 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: 64, independent: 64, independent conditional: 36, independent unconditional: 28, 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: 64, independent: 64, independent conditional: 36, independent unconditional: 28, 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: 64, independent: 64, independent conditional: 36, independent unconditional: 28, 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: 22, independent: 22, independent conditional: 15, independent unconditional: 7, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 64, independent: 42, independent conditional: 21, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 15, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 33, Positive conditional cache size: 17, Positive unconditional cache size: 16, 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: 4.5s, 69 PlacesBefore, 67 PlacesAfterwards, 123 TransitionsBefore, 121 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, independent: 49, independent conditional: 49, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 31, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, independent: 31, independent conditional: 0, independent unconditional: 31, 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: 49, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 65, Positive conditional cache size: 49, Positive unconditional cache size: 16, 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.3s, 67 PlacesBefore, 67 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 68, Positive conditional cache size: 52, Positive unconditional cache size: 16, 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: 1.2s, 70 PlacesBefore, 68 PlacesAfterwards, 91 TransitionsBefore, 89 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 48, 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: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 235, Positive conditional cache size: 219, Positive unconditional cache size: 16, 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, 68 PlacesBefore, 68 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 235, Positive conditional cache size: 219, Positive unconditional cache size: 16, 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, 66 PlacesBefore, 66 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 488 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): 235, Positive cache size: 235, Positive conditional cache size: 219, Positive unconditional cache size: 16, 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, 68 PlacesBefore, 68 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 414 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): 235, Positive cache size: 235, Positive conditional cache size: 219, Positive unconditional cache size: 16, 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, 69 PlacesBefore, 69 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 235, Positive conditional cache size: 219, Positive unconditional cache size: 16, 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: 5.1s, 97 PlacesBefore, 92 PlacesAfterwards, 128 TransitionsBefore, 123 TransitionsAfterwards, 590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 6 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 29, independent unconditional: 6, 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: 35, independent: 35, independent conditional: 29, independent unconditional: 6, 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: 30, independent: 30, independent conditional: 24, 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: 30, independent: 30, independent conditional: 0, independent unconditional: 30, 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: 35, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 30, unknown conditional: 24, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 306, Positive cache size: 306, Positive conditional cache size: 282, Positive unconditional cache size: 24, 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: 6, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread3Thread1of1ForFork0_#t~mem9_107 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread3Thread1of1ForFork0_#t~mem9_107 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:36:36,163 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...