/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 13:21:36,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:21:36,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:21:36,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:21:36,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:21:36,581 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:21:36,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:21:36,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:21:36,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:21:36,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:21:36,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:21:36,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:21:36,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:21:36,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:21:36,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:21:36,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:21:36,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:21:36,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:21:36,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:21:36,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:21:36,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:21:36,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:21:36,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:21:36,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:21:36,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:21:36,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:21:36,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:21:36,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:21:36,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:21:36,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:21:36,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:21:36,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:21:36,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:21:36,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:21:36,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:21:36,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:21:36,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:21:36,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:21:36,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:21:36,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:21:36,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:21:36,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:21:36,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:21:36,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:21:36,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:21:36,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:21:36,677 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:21:36,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:21:36,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:21:36,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:21:36,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:21:36,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:21:36,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:21:36,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:21:36,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:21:36,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:21:36,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:21:36,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:21:36,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:21:36,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:21:36,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:21:36,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:21:36,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:21:36,681 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:21:36,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 13:21:36,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:21:36,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:21:36,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:21:36,995 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:21:36,997 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:21:36,998 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-12-13 13:21:37,997 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:21:38,190 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:21:38,190 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-12-13 13:21:38,212 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13aaf433/ab025931a2944f30be50742c7b6e4f66/FLAG670fb204d [2022-12-13 13:21:38,224 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13aaf433/ab025931a2944f30be50742c7b6e4f66 [2022-12-13 13:21:38,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:21:38,226 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:21:38,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:21:38,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:21:38,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:21:38,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298447b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38, skipping insertion in model container [2022-12-13 13:21:38,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:21:38,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:21:38,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:38,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:38,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:38,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:38,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:38,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:38,406 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-max-array.wvr.c[2553,2566] [2022-12-13 13:21:38,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:21:38,425 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:21:38,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:38,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:38,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:38,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:38,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:21:38,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:21:38,456 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-max-array.wvr.c[2553,2566] [2022-12-13 13:21:38,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:21:38,473 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:21:38,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38 WrapperNode [2022-12-13 13:21:38,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:21:38,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:21:38,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:21:38,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:21:38,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,513 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-12-13 13:21:38,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:21:38,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:21:38,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:21:38,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:21:38,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,551 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:21:38,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:21:38,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:21:38,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:21:38,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (1/1) ... [2022-12-13 13:21:38,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:21:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:21:38,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:21:38,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:21:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:21:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:21:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:21:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:21:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:21:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 13:21:38,609 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:21:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:21:38,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:21:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:21:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:21:38,611 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:21:38,719 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:21:38,720 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:21:38,914 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:21:38,963 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:21:38,964 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 13:21:38,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:21:38 BoogieIcfgContainer [2022-12-13 13:21:38,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:21:38,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:21:38,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:21:38,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:21:38,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:21:38" (1/3) ... [2022-12-13 13:21:38,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2b1dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:21:38, skipping insertion in model container [2022-12-13 13:21:38,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:21:38" (2/3) ... [2022-12-13 13:21:38,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c2b1dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:21:38, skipping insertion in model container [2022-12-13 13:21:38,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:21:38" (3/3) ... [2022-12-13 13:21:38,972 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-12-13 13:21:38,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:21:38,986 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:21:38,986 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:21:39,033 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 13:21:39,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 141 transitions, 306 flow [2022-12-13 13:21:39,147 INFO L130 PetriNetUnfolder]: 12/138 cut-off events. [2022-12-13 13:21:39,147 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:21:39,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 12/138 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 13:21:39,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 141 transitions, 306 flow [2022-12-13 13:21:39,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 128 transitions, 274 flow [2022-12-13 13:21:39,160 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:21:39,177 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-13 13:21:39,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 128 transitions, 274 flow [2022-12-13 13:21:39,220 INFO L130 PetriNetUnfolder]: 12/128 cut-off events. [2022-12-13 13:21:39,221 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:21:39,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 12/128 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2022-12-13 13:21:39,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 128 transitions, 274 flow [2022-12-13 13:21:39,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-13 13:21:43,120 INFO L241 LiptonReduction]: Total number of compositions: 104 [2022-12-13 13:21:43,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:21:43,133 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;@20a65815, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:21:43,133 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 13:21:43,155 INFO L130 PetriNetUnfolder]: 4/23 cut-off events. [2022-12-13 13:21:43,156 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 13:21:43,159 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:43,159 INFO L214 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-13 13:21:43,160 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-13 13:21:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:43,165 INFO L85 PathProgramCache]: Analyzing trace with hash -833214972, now seen corresponding path program 1 times [2022-12-13 13:21:43,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:43,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891687680] [2022-12-13 13:21:43,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:43,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:43,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:43,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:43,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:43,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891687680] [2022-12-13 13:21:43,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891687680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:43,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:43,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:21:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337206365] [2022-12-13 13:21:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:43,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:43,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:43,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:43,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 13:21:43,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-13 13:21:43,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:43,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 13:21:43,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:43,685 INFO L130 PetriNetUnfolder]: 265/372 cut-off events. [2022-12-13 13:21:43,685 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 13:21:43,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 372 events. 265/372 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1070 event pairs, 132 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 606. Up to 368 conditions per place. [2022-12-13 13:21:43,691 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 21 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 13:21:43,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 114 flow [2022-12-13 13:21:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-13 13:21:43,699 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 13:21:43,701 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-13 13:21:43,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 114 flow [2022-12-13 13:21:43,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 13:21:43,705 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 66 flow [2022-12-13 13:21:43,706 INFO L277 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-13 13:21:43,710 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2022-12-13 13:21:43,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:21:43,711 INFO L89 Accepts]: Start accepts. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 13:21:43,713 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:21:43,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:21:43,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 13:21:43,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions, 66 flow [2022-12-13 13:21:43,719 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 13:21:43,719 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:21:43,721 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 15 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-13 13:21:43,722 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 25 transitions, 66 flow [2022-12-13 13:21:43,723 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 13:21:44,754 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:21:44,755 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1044 [2022-12-13 13:21:44,755 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 62 flow [2022-12-13 13:21:44,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-13 13:21:44,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:44,756 INFO L214 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-13 13:21:44,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:21:44,756 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-13 13:21:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:44,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1604053399, now seen corresponding path program 1 times [2022-12-13 13:21:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:44,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153417295] [2022-12-13 13:21:44,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:44,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153417295] [2022-12-13 13:21:44,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153417295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:44,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:44,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:21:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607429192] [2022-12-13 13:21:44,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:44,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:44,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:44,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:44,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:44,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 24 [2022-12-13 13:21:44,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:44,899 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:44,899 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 24 [2022-12-13 13:21:44,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:45,029 INFO L130 PetriNetUnfolder]: 622/886 cut-off events. [2022-12-13 13:21:45,030 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-13 13:21:45,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 886 events. 622/886 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3349 event pairs, 231 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 1789. Up to 346 conditions per place. [2022-12-13 13:21:45,036 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 57 selfloop transitions, 6 changer transitions 0/65 dead transitions. [2022-12-13 13:21:45,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 65 transitions, 284 flow [2022-12-13 13:21:45,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2022-12-13 13:21:45,038 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2022-12-13 13:21:45,038 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 62 flow. Second operand 6 states and 77 transitions. [2022-12-13 13:21:45,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 65 transitions, 284 flow [2022-12-13 13:21:45,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 65 transitions, 272 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:45,040 INFO L231 Difference]: Finished difference. Result has 32 places, 28 transitions, 92 flow [2022-12-13 13:21:45,040 INFO L277 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=28} [2022-12-13 13:21:45,040 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2022-12-13 13:21:45,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:21:45,040 INFO L89 Accepts]: Start accepts. Operand has 32 places, 28 transitions, 92 flow [2022-12-13 13:21:45,042 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:21:45,042 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:21:45,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 28 transitions, 92 flow [2022-12-13 13:21:45,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 92 flow [2022-12-13 13:21:45,047 INFO L130 PetriNetUnfolder]: 7/49 cut-off events. [2022-12-13 13:21:45,048 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:21:45,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 49 events. 7/49 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 6 conditions per place. [2022-12-13 13:21:45,049 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 28 transitions, 92 flow [2022-12-13 13:21:45,049 INFO L226 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-13 13:21:45,130 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:21:45,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-13 13:21:45,132 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 81 flow [2022-12-13 13:21:45,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:45,132 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:45,132 INFO L214 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-13 13:21:45,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:21:45,132 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-13 13:21:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 107427638, now seen corresponding path program 1 times [2022-12-13 13:21:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:45,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373975703] [2022-12-13 13:21:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:45,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:45,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373975703] [2022-12-13 13:21:45,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373975703] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:45,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:45,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:21:45,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084984842] [2022-12-13 13:21:45,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:45,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:21:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:21:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:21:45,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 25 [2022-12-13 13:21:45,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 81 flow. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-13 13:21:45,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:45,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 25 [2022-12-13 13:21:45,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:45,397 INFO L130 PetriNetUnfolder]: 535/808 cut-off events. [2022-12-13 13:21:45,397 INFO L131 PetriNetUnfolder]: For 326/376 co-relation queries the response was YES. [2022-12-13 13:21:45,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 808 events. 535/808 cut-off events. For 326/376 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2865 event pairs, 158 based on Foata normal form. 50/656 useless extension candidates. Maximal degree in co-relation 1228. Up to 386 conditions per place. [2022-12-13 13:21:45,401 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 53 selfloop transitions, 10 changer transitions 3/66 dead transitions. [2022-12-13 13:21:45,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 66 transitions, 335 flow [2022-12-13 13:21:45,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:21:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:21:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-12-13 13:21:45,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41714285714285715 [2022-12-13 13:21:45,404 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 81 flow. Second operand 7 states and 73 transitions. [2022-12-13 13:21:45,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 66 transitions, 335 flow [2022-12-13 13:21:45,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 310 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:45,407 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 116 flow [2022-12-13 13:21:45,407 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2022-12-13 13:21:45,408 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2022-12-13 13:21:45,408 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:21:45,408 INFO L89 Accepts]: Start accepts. Operand has 38 places, 29 transitions, 116 flow [2022-12-13 13:21:45,410 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:21:45,410 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:21:45,410 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 116 flow [2022-12-13 13:21:45,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 116 flow [2022-12-13 13:21:45,414 INFO L130 PetriNetUnfolder]: 11/50 cut-off events. [2022-12-13 13:21:45,415 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 13:21:45,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 50 events. 11/50 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 106 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 88. Up to 12 conditions per place. [2022-12-13 13:21:45,415 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 116 flow [2022-12-13 13:21:45,415 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 13:21:46,556 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:21:46,557 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1149 [2022-12-13 13:21:46,557 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 112 flow [2022-12-13 13:21:46,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-13 13:21:46,557 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:46,557 INFO L214 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-13 13:21:46,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:21:46,557 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-13 13:21:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1764033824, now seen corresponding path program 1 times [2022-12-13 13:21:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:46,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025883354] [2022-12-13 13:21:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:47,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:47,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025883354] [2022-12-13 13:21:47,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025883354] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:21:47,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910618470] [2022-12-13 13:21:47,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:47,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:21:47,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:21:47,152 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:21:47,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:21:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:47,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 13:21:47,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:21:47,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 13:21:47,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:21:47,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:21:47,392 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-13 13:21:47,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:21:47,487 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-13 13:21:47,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:21:47,565 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 65 treesize of output 45 [2022-12-13 13:21:47,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:47,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:21:49,922 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_117 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_117) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse0) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0)))) (or (forall ((v_ArrVal_117 (Array Int Int)) (~M~0 Int)) (or (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_117) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))) (= c_~max1~0 c_~max2~0))) is different from false [2022-12-13 13:21:51,992 WARN L837 $PredicateComparison]: unable to prove that (and (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_116 (Array Int Int)) (~M~0 Int)) (or (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_116) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_117) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0)))) (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_116 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_116) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_117) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (= c_~max1~0 .cse0) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-12-13 13:21:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:56,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910618470] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:21:56,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:21:56,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2022-12-13 13:21:56,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738554961] [2022-12-13 13:21:56,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:21:56,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:21:56,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:56,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:21:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=179, Unknown=2, NotChecked=58, Total=306 [2022-12-13 13:21:56,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 22 [2022-12-13 13:21:56,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 112 flow. Second operand has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:56,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:56,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 22 [2022-12-13 13:21:56,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:57,231 INFO L130 PetriNetUnfolder]: 641/966 cut-off events. [2022-12-13 13:21:57,231 INFO L131 PetriNetUnfolder]: For 640/687 co-relation queries the response was YES. [2022-12-13 13:21:57,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 966 events. 641/966 cut-off events. For 640/687 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3890 event pairs, 32 based on Foata normal form. 48/874 useless extension candidates. Maximal degree in co-relation 1148. Up to 647 conditions per place. [2022-12-13 13:21:57,236 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 66 selfloop transitions, 22 changer transitions 3/93 dead transitions. [2022-12-13 13:21:57,236 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 93 transitions, 521 flow [2022-12-13 13:21:57,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:21:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:21:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-13 13:21:57,237 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.564935064935065 [2022-12-13 13:21:57,238 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 112 flow. Second operand 7 states and 87 transitions. [2022-12-13 13:21:57,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 93 transitions, 521 flow [2022-12-13 13:21:57,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 93 transitions, 480 flow, removed 19 selfloop flow, removed 4 redundant places. [2022-12-13 13:21:57,241 INFO L231 Difference]: Finished difference. Result has 39 places, 48 transitions, 256 flow [2022-12-13 13:21:57,241 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=256, PETRI_PLACES=39, PETRI_TRANSITIONS=48} [2022-12-13 13:21:57,241 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2022-12-13 13:21:57,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:21:57,242 INFO L89 Accepts]: Start accepts. Operand has 39 places, 48 transitions, 256 flow [2022-12-13 13:21:57,242 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:21:57,242 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:21:57,242 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 48 transitions, 256 flow [2022-12-13 13:21:57,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 48 transitions, 256 flow [2022-12-13 13:21:57,250 INFO L130 PetriNetUnfolder]: 45/126 cut-off events. [2022-12-13 13:21:57,250 INFO L131 PetriNetUnfolder]: For 67/71 co-relation queries the response was YES. [2022-12-13 13:21:57,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 126 events. 45/126 cut-off events. For 67/71 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 450 event pairs, 0 based on Foata normal form. 4/127 useless extension candidates. Maximal degree in co-relation 275. Up to 46 conditions per place. [2022-12-13 13:21:57,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 48 transitions, 256 flow [2022-12-13 13:21:57,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-13 13:21:57,291 WARN L322 ript$VariableManager]: TermVariable LBE235 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:21:57,291 WARN L322 ript$VariableManager]: TermVariable LBE230 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:21:57,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0] [2022-12-13 13:21:57,576 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [550] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_87) (let ((.cse1 (select (select |v_#memory_int_176| v_~A~0.base_93) v_~A~0.offset_93))) (let ((.cse0 (< v_~max1~0_67 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (= v_~max1~0_67 v_~max1~0_66)) (and (= v_~max1~0_66 .cse1) .cse0)))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~max1~0=v_~max1~0_67, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_20|, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_66, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_11|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:21:57,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [504] L46-4-->L46-4: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_30 1) v_thread1Thread1of1ForFork0_~i~0_29) (< v_thread1Thread1of1ForFork0_~i~0_30 v_~N~0_45) (let ((.cse1 (select (select |v_#memory_int_126| v_~A~0.base_69) (+ (* v_thread1Thread1of1ForFork0_~i~0_30 4) v_~A~0.offset_69)))) (let ((.cse0 (< v_~max1~0_41 .cse1))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_16| |v_thread1Thread1of1ForFork0_#t~mem3_15|) (not .cse0) (= v_~max1~0_41 v_~max1~0_40)) (and .cse0 (= v_~max1~0_40 .cse1)))))) InVars {~max1~0=v_~max1~0_41, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_16|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_30, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} OutVars{~max1~0=v_~max1~0_40, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_9|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_15|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_29, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:21:57,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0] [2022-12-13 13:21:57,885 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [494] L58-4-->L58-4: Formula: (and (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (let ((.cse0 (select (select |v_#memory_int_116| v_~A~0.base_61) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_61)))) (let ((.cse1 (< v_~max2~0_92 .cse0))) (or (and (= v_~max2~0_91 .cse0) .cse1) (and (= |v_thread2Thread1of1ForFork1_#t~mem6_36| |v_thread2Thread1of1ForFork1_#t~mem6_35|) (not .cse1) (= v_~max2~0_92 v_~max2~0_91))))) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_61, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_36|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_92, #memory_int=|v_#memory_int_116|} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_19|, ~A~0.base=v_~A~0.base_61, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_19|, ~A~0.offset=v_~A~0.offset_61, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_35|, ~M~0=v_~M~0_27, ~max2~0=v_~max2~0_91, #memory_int=|v_#memory_int_116|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~max2~0] [2022-12-13 13:21:57,986 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [504] L46-4-->L46-4: Formula: (and (= (+ v_thread1Thread1of1ForFork0_~i~0_30 1) v_thread1Thread1of1ForFork0_~i~0_29) (< v_thread1Thread1of1ForFork0_~i~0_30 v_~N~0_45) (let ((.cse1 (select (select |v_#memory_int_126| v_~A~0.base_69) (+ (* v_thread1Thread1of1ForFork0_~i~0_30 4) v_~A~0.offset_69)))) (let ((.cse0 (< v_~max1~0_41 .cse1))) (or (and (= |v_thread1Thread1of1ForFork0_#t~mem3_16| |v_thread1Thread1of1ForFork0_#t~mem3_15|) (not .cse0) (= v_~max1~0_41 v_~max1~0_40)) (and .cse0 (= v_~max1~0_40 .cse1)))))) InVars {~max1~0=v_~max1~0_41, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_16|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_30, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} OutVars{~max1~0=v_~max1~0_40, ~A~0.base=v_~A~0.base_69, ~A~0.offset=v_~A~0.offset_69, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_9|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_15|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_17|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_29, #memory_int=|v_#memory_int_126|, ~N~0=v_~N~0_45} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:21:58,086 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:21:58,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-13 13:21:58,087 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 47 transitions, 288 flow [2022-12-13 13:21:58,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.611111111111111) internal successors, (65), 18 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:58,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:58,087 INFO L214 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-13 13:21:58,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:21:58,287 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-13 13:21:58,288 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-13 13:21:58,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash 590579866, now seen corresponding path program 2 times [2022-12-13 13:21:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:58,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970086593] [2022-12-13 13:21:58,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:59,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:59,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970086593] [2022-12-13 13:21:59,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970086593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:21:59,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782270053] [2022-12-13 13:21:59,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:21:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:21:59,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:21:59,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:21:59,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:21:59,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:21:59,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:21:59,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:21:59,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:21:59,280 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-13 13:21:59,280 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 75 treesize of output 65 [2022-12-13 13:21:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:59,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:21:59,428 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:21:59,428 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 75 treesize of output 49 [2022-12-13 13:21:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:59,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782270053] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:21:59,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:21:59,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 16 [2022-12-13 13:21:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32734516] [2022-12-13 13:21:59,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:21:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:21:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:21:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:21:59,499 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:21:59,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 47 transitions, 288 flow. Second operand has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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-13 13:21:59,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:59,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:21:59,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:00,075 INFO L130 PetriNetUnfolder]: 871/1308 cut-off events. [2022-12-13 13:22:00,075 INFO L131 PetriNetUnfolder]: For 2604/2604 co-relation queries the response was YES. [2022-12-13 13:22:00,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4456 conditions, 1308 events. 871/1308 cut-off events. For 2604/2604 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5079 event pairs, 216 based on Foata normal form. 8/1296 useless extension candidates. Maximal degree in co-relation 4327. Up to 1043 conditions per place. [2022-12-13 13:22:00,080 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 71 selfloop transitions, 32 changer transitions 3/106 dead transitions. [2022-12-13 13:22:00,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 106 transitions, 767 flow [2022-12-13 13:22:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:22:00,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:22:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2022-12-13 13:22:00,082 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3524904214559387 [2022-12-13 13:22:00,082 INFO L175 Difference]: Start difference. First operand has 38 places, 47 transitions, 288 flow. Second operand 9 states and 92 transitions. [2022-12-13 13:22:00,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 106 transitions, 767 flow [2022-12-13 13:22:00,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 106 transitions, 747 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:00,104 INFO L231 Difference]: Finished difference. Result has 51 places, 72 transitions, 574 flow [2022-12-13 13:22:00,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=574, PETRI_PLACES=51, PETRI_TRANSITIONS=72} [2022-12-13 13:22:00,107 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2022-12-13 13:22:00,107 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:00,107 INFO L89 Accepts]: Start accepts. Operand has 51 places, 72 transitions, 574 flow [2022-12-13 13:22:00,108 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:00,108 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:00,108 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 72 transitions, 574 flow [2022-12-13 13:22:00,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 72 transitions, 574 flow [2022-12-13 13:22:00,121 INFO L130 PetriNetUnfolder]: 71/205 cut-off events. [2022-12-13 13:22:00,121 INFO L131 PetriNetUnfolder]: For 318/321 co-relation queries the response was YES. [2022-12-13 13:22:00,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 205 events. 71/205 cut-off events. For 318/321 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 942 event pairs, 0 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 552. Up to 65 conditions per place. [2022-12-13 13:22:00,123 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 72 transitions, 574 flow [2022-12-13 13:22:00,123 INFO L226 LiptonReduction]: Number of co-enabled transitions 512 [2022-12-13 13:22:00,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [553] $Ultimate##0-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~A~0.base_110))) (and (let ((.cse1 (select .cse2 (+ (* v_thread1Thread1of1ForFork0_~i~0_52 4) v_~A~0.offset_110 (- 4))))) (let ((.cse0 (< v_~max1~0_95 .cse1))) (or (and (not .cse0) (= v_~max1~0_95 v_~max1~0_94) (= |v_thread1Thread1of1ForFork0_#t~mem3_45| |v_thread1Thread1of1ForFork0_#t~mem3_44|)) (and (= v_~max1~0_94 .cse1) .cse0)))) (= 2 v_thread1Thread1of1ForFork0_~i~0_52) (let ((.cse4 (select .cse2 v_~A~0.offset_110))) (let ((.cse3 (< v_~max1~0_96 .cse4))) (or (and (= v_~max1~0_96 v_~max1~0_95) (= |v_thread1Thread1of1ForFork0_#t~mem3_46| |v_thread1Thread1of1ForFork0_#t~mem3_45|) (not .cse3)) (and (= v_~max1~0_95 .cse4) .cse3)))) (< v_thread1Thread1of1ForFork0_~i~0_52 (+ v_~N~0_103 1)))) InVars {~max1~0=v_~max1~0_96, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_46|, #memory_int=|v_#memory_int_207|, ~N~0=v_~N~0_103} OutVars{~max1~0=v_~max1~0_94, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_24|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_32|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, #memory_int=|v_#memory_int_207|, ~N~0=v_~N~0_103} AuxVars[v_~max1~0_95, |v_thread1Thread1of1ForFork0_#t~mem3_45|] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:22:00,341 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [550] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_87) (let ((.cse1 (select (select |v_#memory_int_176| v_~A~0.base_93) v_~A~0.offset_93))) (let ((.cse0 (< v_~max1~0_67 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (= v_~max1~0_67 v_~max1~0_66)) (and (= v_~max1~0_66 .cse1) .cse0)))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~max1~0=v_~max1~0_67, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_20|, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_66, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_11|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:22:00,402 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-13 13:22:00,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] and [553] $Ultimate##0-->L46-4: Formula: (let ((.cse2 (select |v_#memory_int_207| v_~A~0.base_110))) (and (let ((.cse1 (select .cse2 (+ (* v_thread1Thread1of1ForFork0_~i~0_52 4) v_~A~0.offset_110 (- 4))))) (let ((.cse0 (< v_~max1~0_95 .cse1))) (or (and (not .cse0) (= v_~max1~0_95 v_~max1~0_94) (= |v_thread1Thread1of1ForFork0_#t~mem3_45| |v_thread1Thread1of1ForFork0_#t~mem3_44|)) (and (= v_~max1~0_94 .cse1) .cse0)))) (= 2 v_thread1Thread1of1ForFork0_~i~0_52) (let ((.cse4 (select .cse2 v_~A~0.offset_110))) (let ((.cse3 (< v_~max1~0_96 .cse4))) (or (and (= v_~max1~0_96 v_~max1~0_95) (= |v_thread1Thread1of1ForFork0_#t~mem3_46| |v_thread1Thread1of1ForFork0_#t~mem3_45|) (not .cse3)) (and (= v_~max1~0_95 .cse4) .cse3)))) (< v_thread1Thread1of1ForFork0_~i~0_52 (+ v_~N~0_103 1)))) InVars {~max1~0=v_~max1~0_96, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_46|, #memory_int=|v_#memory_int_207|, ~N~0=v_~N~0_103} OutVars{~max1~0=v_~max1~0_94, ~A~0.base=v_~A~0.base_110, ~A~0.offset=v_~A~0.offset_110, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_24|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_32|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_52, #memory_int=|v_#memory_int_207|, ~N~0=v_~N~0_103} AuxVars[v_~max1~0_95, |v_thread1Thread1of1ForFork0_#t~mem3_45|] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:22:00,539 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] and [550] $Ultimate##0-->L46-4: Formula: (and (< 0 v_~N~0_87) (let ((.cse1 (select (select |v_#memory_int_176| v_~A~0.base_93) v_~A~0.offset_93))) (let ((.cse0 (< v_~max1~0_67 .cse1))) (or (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_19| |v_thread1Thread1of1ForFork0_#t~mem3_20|) (= v_~max1~0_67 v_~max1~0_66)) (and (= v_~max1~0_66 .cse1) .cse0)))) (= v_thread1Thread1of1ForFork0_~i~0_33 1)) InVars {~max1~0=v_~max1~0_67, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_20|, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} OutVars{~max1~0=v_~max1~0_66, ~A~0.base=v_~A~0.base_93, ~A~0.offset=v_~A~0.offset_93, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_11|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_19|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_33, #memory_int=|v_#memory_int_176|, ~N~0=v_~N~0_87} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-13 13:22:00,599 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:22:00,600 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 493 [2022-12-13 13:22:00,600 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 71 transitions, 603 flow [2022-12-13 13:22:00,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 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-13 13:22:00,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:00,600 INFO L214 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-13 13:22:00,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:22:00,800 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-13 13:22:00,801 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-13 13:22:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:00,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1307525543, now seen corresponding path program 1 times [2022-12-13 13:22:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:00,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209229393] [2022-12-13 13:22:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:00,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:22:00,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:00,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209229393] [2022-12-13 13:22:00,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209229393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:00,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:00,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:22:00,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031781723] [2022-12-13 13:22:00,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:00,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:22:00,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:00,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:22:00,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:22:00,845 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-13 13:22:00,845 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 71 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-13 13:22:00,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:00,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-13 13:22:00,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:00,931 INFO L130 PetriNetUnfolder]: 629/958 cut-off events. [2022-12-13 13:22:00,932 INFO L131 PetriNetUnfolder]: For 3810/3889 co-relation queries the response was YES. [2022-12-13 13:22:00,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3878 conditions, 958 events. 629/958 cut-off events. For 3810/3889 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3928 event pairs, 268 based on Foata normal form. 77/1022 useless extension candidates. Maximal degree in co-relation 2906. Up to 940 conditions per place. [2022-12-13 13:22:00,936 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 54 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2022-12-13 13:22:00,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 617 flow [2022-12-13 13:22:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:22:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:22:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-13 13:22:00,937 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37142857142857144 [2022-12-13 13:22:00,937 INFO L175 Difference]: Start difference. First operand has 50 places, 71 transitions, 603 flow. Second operand 3 states and 39 transitions. [2022-12-13 13:22:00,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 617 flow [2022-12-13 13:22:00,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 588 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:00,941 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 480 flow [2022-12-13 13:22:00,941 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2022-12-13 13:22:00,942 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2022-12-13 13:22:00,942 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:00,942 INFO L89 Accepts]: Start accepts. Operand has 50 places, 61 transitions, 480 flow [2022-12-13 13:22:00,942 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:00,942 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:00,943 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 61 transitions, 480 flow [2022-12-13 13:22:00,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 61 transitions, 480 flow [2022-12-13 13:22:00,952 INFO L130 PetriNetUnfolder]: 55/158 cut-off events. [2022-12-13 13:22:00,952 INFO L131 PetriNetUnfolder]: For 317/326 co-relation queries the response was YES. [2022-12-13 13:22:00,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 158 events. 55/158 cut-off events. For 317/326 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 640 event pairs, 0 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 481. Up to 50 conditions per place. [2022-12-13 13:22:00,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 61 transitions, 480 flow [2022-12-13 13:22:00,954 INFO L226 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-13 13:22:00,954 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:22:00,955 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 13:22:00,955 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 61 transitions, 480 flow [2022-12-13 13:22:00,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-13 13:22:00,955 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:00,955 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:00,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:22:00,955 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-13 13:22:00,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1488924602, now seen corresponding path program 1 times [2022-12-13 13:22:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346836228] [2022-12-13 13:22:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:01,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:22:01,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:01,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346836228] [2022-12-13 13:22:01,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346836228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:01,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:01,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:22:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695452279] [2022-12-13 13:22:01,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:01,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:22:01,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:01,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:22:01,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:22:01,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-13 13:22:01,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 61 transitions, 480 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-13 13:22:01,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:01,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-13 13:22:01,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:01,125 INFO L130 PetriNetUnfolder]: 527/848 cut-off events. [2022-12-13 13:22:01,126 INFO L131 PetriNetUnfolder]: For 3219/3283 co-relation queries the response was YES. [2022-12-13 13:22:01,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3289 conditions, 848 events. 527/848 cut-off events. For 3219/3283 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3646 event pairs, 182 based on Foata normal form. 126/955 useless extension candidates. Maximal degree in co-relation 3269. Up to 720 conditions per place. [2022-12-13 13:22:01,130 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 9 changer transitions 1/67 dead transitions. [2022-12-13 13:22:01,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 629 flow [2022-12-13 13:22:01,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 13:22:01,132 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2022-12-13 13:22:01,132 INFO L175 Difference]: Start difference. First operand has 50 places, 61 transitions, 480 flow. Second operand 4 states and 49 transitions. [2022-12-13 13:22:01,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 629 flow [2022-12-13 13:22:01,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 628 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:01,136 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 443 flow [2022-12-13 13:22:01,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=443, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-13 13:22:01,137 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2022-12-13 13:22:01,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:01,138 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 443 flow [2022-12-13 13:22:01,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:01,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:01,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 443 flow [2022-12-13 13:22:01,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 443 flow [2022-12-13 13:22:01,150 INFO L130 PetriNetUnfolder]: 35/124 cut-off events. [2022-12-13 13:22:01,150 INFO L131 PetriNetUnfolder]: For 285/294 co-relation queries the response was YES. [2022-12-13 13:22:01,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 124 events. 35/124 cut-off events. For 285/294 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 501 event pairs, 0 based on Foata normal form. 5/127 useless extension candidates. Maximal degree in co-relation 391. Up to 33 conditions per place. [2022-12-13 13:22:01,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 443 flow [2022-12-13 13:22:01,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-13 13:22:01,957 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:22:01,958 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 821 [2022-12-13 13:22:01,958 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 501 flow [2022-12-13 13:22:01,958 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-13 13:22:01,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:01,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:01,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:22:01,958 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-13 13:22:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash -798345047, now seen corresponding path program 1 times [2022-12-13 13:22:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:01,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281603374] [2022-12-13 13:22:01,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:02,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281603374] [2022-12-13 13:22:02,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281603374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:22:02,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969357160] [2022-12-13 13:22:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:02,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:22:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:22:02,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:22:02,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:22:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:02,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 13:22:02,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:02,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:22:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:02,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969357160] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 13:22:02,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:22:02,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2022-12-13 13:22:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383715384] [2022-12-13 13:22:02,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:02,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:22:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:02,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:22:02,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:22:02,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 13:22:02,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 501 flow. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:02,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:02,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 13:22:02,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:02,370 INFO L130 PetriNetUnfolder]: 867/1378 cut-off events. [2022-12-13 13:22:02,370 INFO L131 PetriNetUnfolder]: For 4225/4225 co-relation queries the response was YES. [2022-12-13 13:22:02,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5312 conditions, 1378 events. 867/1378 cut-off events. For 4225/4225 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6429 event pairs, 58 based on Foata normal form. 72/1420 useless extension candidates. Maximal degree in co-relation 5291. Up to 686 conditions per place. [2022-12-13 13:22:02,375 INFO L137 encePairwiseOnDemand]: 20/35 looper letters, 86 selfloop transitions, 27 changer transitions 11/124 dead transitions. [2022-12-13 13:22:02,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 124 transitions, 1229 flow [2022-12-13 13:22:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:22:02,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:22:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2022-12-13 13:22:02,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-13 13:22:02,376 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 501 flow. Second operand 7 states and 84 transitions. [2022-12-13 13:22:02,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 124 transitions, 1229 flow [2022-12-13 13:22:02,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 1199 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:02,382 INFO L231 Difference]: Finished difference. Result has 60 places, 70 transitions, 689 flow [2022-12-13 13:22:02,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=689, PETRI_PLACES=60, PETRI_TRANSITIONS=70} [2022-12-13 13:22:02,382 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2022-12-13 13:22:02,382 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:02,383 INFO L89 Accepts]: Start accepts. Operand has 60 places, 70 transitions, 689 flow [2022-12-13 13:22:02,383 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:02,383 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:02,383 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 70 transitions, 689 flow [2022-12-13 13:22:02,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 70 transitions, 689 flow [2022-12-13 13:22:02,400 INFO L130 PetriNetUnfolder]: 106/273 cut-off events. [2022-12-13 13:22:02,400 INFO L131 PetriNetUnfolder]: For 1121/1167 co-relation queries the response was YES. [2022-12-13 13:22:02,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1098 conditions, 273 events. 106/273 cut-off events. For 1121/1167 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1407 event pairs, 0 based on Foata normal form. 9/276 useless extension candidates. Maximal degree in co-relation 1076. Up to 90 conditions per place. [2022-12-13 13:22:02,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 70 transitions, 689 flow [2022-12-13 13:22:02,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 440 [2022-12-13 13:22:02,403 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [570] L70-4-->thread1EXIT: Formula: (and (not (< v_thread3Thread1of1ForFork2_~i~2_70 v_~N~0_143)) (= |v_thread3Thread1of1ForFork2_#res.offset_31| 0) (< 0 v_~N~0_143) (not (< v_thread1Thread1of1ForFork0_~i~0_90 v_~N~0_143)) (let ((.cse1 (select (select |v_#memory_int_253| v_~A~0.base_150) v_~A~0.offset_150))) (let ((.cse0 (< v_~max1~0_170 .cse1))) (or (and .cse0 (= v_~max1~0_169 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_119| |v_thread1Thread1of1ForFork0_#t~mem3_118|) (= v_~max1~0_169 v_~max1~0_170))))) (= |v_thread1Thread1of1ForFork0_#res.base_25| 0) (= v_thread1Thread1of1ForFork0_~i~0_90 1) (= |v_thread1Thread1of1ForFork0_#res.offset_25| 0) (= |v_thread3Thread1of1ForFork2_#res.base_31| 0)) InVars {~max1~0=v_~max1~0_170, ~A~0.base=v_~A~0.base_150, ~A~0.offset=v_~A~0.offset_150, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_119|, #memory_int=|v_#memory_int_253|, ~N~0=v_~N~0_143, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_70} OutVars{~A~0.base=v_~A~0.base_150, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_25|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_90, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_31|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_25|, ~N~0=v_~N~0_143, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_31|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_70, ~max1~0=v_~max1~0_169, ~A~0.offset=v_~A~0.offset_150, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_58|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_118|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_66|, #memory_int=|v_#memory_int_253|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-13 13:22:02,505 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [539] L70-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_1)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_1} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_1, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-13 13:22:02,534 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [567] L70-4-->thread1EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_29| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_19| 0) (< 0 v_~N~0_137) (= |v_thread1Thread1of1ForFork0_#res.base_19| 0) (= v_thread1Thread1of1ForFork0_~i~0_84 1) (not (< v_thread1Thread1of1ForFork0_~i~0_84 v_~N~0_137)) (let ((.cse0 (select (select |v_#memory_int_247| v_~A~0.base_144) v_~A~0.offset_144))) (let ((.cse1 (< v_~max1~0_158 .cse0))) (or (and (= v_~max1~0_157 .cse0) .cse1) (and (not .cse1) (= |v_thread1Thread1of1ForFork0_#t~mem3_107| |v_thread1Thread1of1ForFork0_#t~mem3_106|) (= v_~max1~0_158 v_~max1~0_157))))) (= |v_thread3Thread1of1ForFork2_#res.offset_29| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_68 v_~N~0_137))) InVars {~max1~0=v_~max1~0_158, ~A~0.base=v_~A~0.base_144, ~A~0.offset=v_~A~0.offset_144, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_107|, #memory_int=|v_#memory_int_247|, ~N~0=v_~N~0_137, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_68} OutVars{~A~0.base=v_~A~0.base_144, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_19|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_29|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_19|, ~N~0=v_~N~0_137, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_29|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_68, ~max1~0=v_~max1~0_157, ~A~0.offset=v_~A~0.offset_144, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_52|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_106|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_60|, #memory_int=|v_#memory_int_247|} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread3Thread1of1ForFork2_#res.offset, thread1Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork2_#res.base] and [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] [2022-12-13 13:22:02,732 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [395] $Ultimate##0-->L58-4: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] and [405] $Ultimate##0-->L70-4: Formula: (= v_thread3Thread1of1ForFork2_~i~2_1 v_~M~0_3) InVars {~M~0=v_~M~0_3} OutVars{~M~0=v_~M~0_3, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:22:02,739 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:22:02,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-13 13:22:02,740 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 707 flow [2022-12-13 13:22:02,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:02,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:02,740 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:02,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:22:02,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:22:02,945 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-13 13:22:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash 777861455, now seen corresponding path program 1 times [2022-12-13 13:22:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:02,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199103013] [2022-12-13 13:22:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:03,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199103013] [2022-12-13 13:22:03,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199103013] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:03,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:03,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:22:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105442086] [2022-12-13 13:22:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:03,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:22:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:22:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:22:03,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 13:22:03,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 707 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:03,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:03,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 13:22:03,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:03,135 INFO L130 PetriNetUnfolder]: 478/789 cut-off events. [2022-12-13 13:22:03,135 INFO L131 PetriNetUnfolder]: For 4773/4817 co-relation queries the response was YES. [2022-12-13 13:22:03,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3735 conditions, 789 events. 478/789 cut-off events. For 4773/4817 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3339 event pairs, 123 based on Foata normal form. 64/849 useless extension candidates. Maximal degree in co-relation 3711. Up to 425 conditions per place. [2022-12-13 13:22:03,139 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 70 selfloop transitions, 9 changer transitions 1/83 dead transitions. [2022-12-13 13:22:03,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 974 flow [2022-12-13 13:22:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-13 13:22:03,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3680555555555556 [2022-12-13 13:22:03,140 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 707 flow. Second operand 4 states and 53 transitions. [2022-12-13 13:22:03,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 974 flow [2022-12-13 13:22:03,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 953 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:03,146 INFO L231 Difference]: Finished difference. Result has 60 places, 71 transitions, 770 flow [2022-12-13 13:22:03,146 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=770, PETRI_PLACES=60, PETRI_TRANSITIONS=71} [2022-12-13 13:22:03,146 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2022-12-13 13:22:03,146 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:03,146 INFO L89 Accepts]: Start accepts. Operand has 60 places, 71 transitions, 770 flow [2022-12-13 13:22:03,147 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:03,147 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:03,147 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 71 transitions, 770 flow [2022-12-13 13:22:03,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 71 transitions, 770 flow [2022-12-13 13:22:03,160 INFO L130 PetriNetUnfolder]: 68/192 cut-off events. [2022-12-13 13:22:03,160 INFO L131 PetriNetUnfolder]: For 1098/1116 co-relation queries the response was YES. [2022-12-13 13:22:03,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 192 events. 68/192 cut-off events. For 1098/1116 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 877 event pairs, 2 based on Foata normal form. 8/190 useless extension candidates. Maximal degree in co-relation 798. Up to 63 conditions per place. [2022-12-13 13:22:03,161 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 71 transitions, 770 flow [2022-12-13 13:22:03,161 INFO L226 LiptonReduction]: Number of co-enabled transitions 380 [2022-12-13 13:22:03,162 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:22:03,162 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 13:22:03,162 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 71 transitions, 770 flow [2022-12-13 13:22:03,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:03,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:03,163 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:03,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:22:03,163 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-13 13:22:03,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:03,163 INFO L85 PathProgramCache]: Analyzing trace with hash -607583880, now seen corresponding path program 1 times [2022-12-13 13:22:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:03,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598526721] [2022-12-13 13:22:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598526721] [2022-12-13 13:22:03,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598526721] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:03,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:03,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:22:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482148934] [2022-12-13 13:22:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:03,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:22:03,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:03,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:22:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:22:03,213 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 13:22:03,213 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 71 transitions, 770 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:03,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:03,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 13:22:03,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:03,289 INFO L130 PetriNetUnfolder]: 280/503 cut-off events. [2022-12-13 13:22:03,289 INFO L131 PetriNetUnfolder]: For 3213/3213 co-relation queries the response was YES. [2022-12-13 13:22:03,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2293 conditions, 503 events. 280/503 cut-off events. For 3213/3213 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2085 event pairs, 57 based on Foata normal form. 58/559 useless extension candidates. Maximal degree in co-relation 2267. Up to 441 conditions per place. [2022-12-13 13:22:03,292 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 46 selfloop transitions, 8 changer transitions 6/60 dead transitions. [2022-12-13 13:22:03,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 651 flow [2022-12-13 13:22:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-13 13:22:03,292 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-13 13:22:03,293 INFO L175 Difference]: Start difference. First operand has 60 places, 71 transitions, 770 flow. Second operand 4 states and 42 transitions. [2022-12-13 13:22:03,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 651 flow [2022-12-13 13:22:03,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 620 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 13:22:03,297 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 401 flow [2022-12-13 13:22:03,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2022-12-13 13:22:03,297 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2022-12-13 13:22:03,297 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:22:03,298 INFO L89 Accepts]: Start accepts. Operand has 59 places, 47 transitions, 401 flow [2022-12-13 13:22:03,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:22:03,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:03,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 47 transitions, 401 flow [2022-12-13 13:22:03,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 47 transitions, 401 flow [2022-12-13 13:22:03,305 INFO L130 PetriNetUnfolder]: 27/101 cut-off events. [2022-12-13 13:22:03,305 INFO L131 PetriNetUnfolder]: For 369/381 co-relation queries the response was YES. [2022-12-13 13:22:03,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 101 events. 27/101 cut-off events. For 369/381 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 383 event pairs, 4 based on Foata normal form. 4/98 useless extension candidates. Maximal degree in co-relation 365. Up to 29 conditions per place. [2022-12-13 13:22:03,306 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 47 transitions, 401 flow [2022-12-13 13:22:03,306 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 13:22:03,309 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,309 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,529 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,529 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,696 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,696 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,864 WARN L322 ript$VariableManager]: TermVariable LBE237 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:03,864 WARN L322 ript$VariableManager]: TermVariable LBE240 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:22:04,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [568] $Ultimate##0-->thread1EXIT: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_86 1) (= |v_thread1Thread1of1ForFork0_#res.base_21| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_21| 0) (let ((.cse1 (select (select |v_#memory_int_249| v_~A~0.base_146) v_~A~0.offset_146))) (let ((.cse0 (< v_~max1~0_162 .cse1))) (or (and .cse0 (= v_~max1~0_161 .cse1)) (and (not .cse0) (= |v_thread1Thread1of1ForFork0_#t~mem3_111| |v_thread1Thread1of1ForFork0_#t~mem3_110|) (= v_~max1~0_162 v_~max1~0_161))))) (not (< v_thread1Thread1of1ForFork0_~i~0_86 v_~N~0_139)) (< 0 v_~N~0_139)) InVars {~max1~0=v_~max1~0_162, ~A~0.base=v_~A~0.base_146, ~A~0.offset=v_~A~0.offset_146, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_111|, #memory_int=|v_#memory_int_249|, ~N~0=v_~N~0_139} OutVars{~max1~0=v_~max1~0_161, ~A~0.base=v_~A~0.base_146, ~A~0.offset=v_~A~0.offset_146, thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_54|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_21|, thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_110|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_62|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_86, #memory_int=|v_#memory_int_249|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_21|, ~N~0=v_~N~0_139} AuxVars[] AssignedVars[~max1~0, thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_#res.offset] and [477] L70-4-->L70-4: Formula: (and (let ((.cse1 (select (select |v_#memory_int_94| v_~A~0.base_55) (+ v_~A~0.offset_55 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (let ((.cse0 (< v_~max2~0_80 .cse1))) (or (and (not .cse0) (= v_~max2~0_80 v_~max2~0_79) (= |v_thread3Thread1of1ForFork2_#t~mem9_32| |v_thread3Thread1of1ForFork2_#t~mem9_31|)) (and (= v_~max2~0_79 .cse1) .cse0)))) (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_33)) InVars {~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_80, #memory_int=|v_#memory_int_94|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_32|, ~N~0=v_~N~0_33, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34} OutVars{~A~0.base=v_~A~0.base_55, ~A~0.offset=v_~A~0.offset_55, ~max2~0=v_~max2~0_79, #memory_int=|v_#memory_int_94|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_17|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_19|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_31|, ~N~0=v_~N~0_33, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33} AuxVars[] AssignedVars[~max2~0, thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2] [2022-12-13 13:22:04,184 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:22:04,184 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 887 [2022-12-13 13:22:04,185 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 403 flow [2022-12-13 13:22:04,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:04,185 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:04,185 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:04,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:22:04,185 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-13 13:22:04,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:04,185 INFO L85 PathProgramCache]: Analyzing trace with hash 510860329, now seen corresponding path program 1 times [2022-12-13 13:22:04,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:22:04,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567516374] [2022-12-13 13:22:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:04,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:22:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:04,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:22:04,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567516374] [2022-12-13 13:22:04,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567516374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:04,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:04,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:22:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228177793] [2022-12-13 13:22:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:04,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:22:04,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:22:04,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:22:04,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:22:04,270 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-13 13:22:04,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 403 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-13 13:22:04,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:04,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-13 13:22:04,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:04,328 INFO L130 PetriNetUnfolder]: 74/172 cut-off events. [2022-12-13 13:22:04,328 INFO L131 PetriNetUnfolder]: For 776/784 co-relation queries the response was YES. [2022-12-13 13:22:04,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 172 events. 74/172 cut-off events. For 776/784 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 660 event pairs, 20 based on Foata normal form. 58/227 useless extension candidates. Maximal degree in co-relation 698. Up to 68 conditions per place. [2022-12-13 13:22:04,329 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 0 selfloop transitions, 0 changer transitions 44/44 dead transitions. [2022-12-13 13:22:04,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 44 transitions, 359 flow [2022-12-13 13:22:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:22:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:22:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-12-13 13:22:04,329 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-13 13:22:04,329 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 403 flow. Second operand 5 states and 44 transitions. [2022-12-13 13:22:04,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 44 transitions, 359 flow [2022-12-13 13:22:04,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 312 flow, removed 2 selfloop flow, removed 11 redundant places. [2022-12-13 13:22:04,331 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2022-12-13 13:22:04,331 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2022-12-13 13:22:04,331 INFO L295 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2022-12-13 13:22:04,331 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:22:04,331 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 0 transitions, 0 flow [2022-12-13 13:22:04,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 13:22:04,332 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 13:22:04,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:22:04,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 13:22:04,332 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 13:22:04,332 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 13:22:04,332 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:22:04,332 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 13:22:04,333 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 13:22:04,333 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-13 13:22:04,334 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 13:22:04,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 13:22:04,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 13:22:04,335 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 13:22:04,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:22:04,335 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:04,337 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:22:04,337 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:22:04,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:22:04 BasicIcfg [2022-12-13 13:22:04,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:22:04,339 INFO L158 Benchmark]: Toolchain (without parser) took 26112.41ms. Allocated memory was 227.5MB in the beginning and 500.2MB in the end (delta: 272.6MB). Free memory was 204.1MB in the beginning and 186.5MB in the end (delta: 17.5MB). Peak memory consumption was 290.7MB. Max. memory is 8.0GB. [2022-12-13 13:22:04,339 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 227.5MB. Free memory is still 205.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 13:22:04,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.96ms. Allocated memory is still 227.5MB. Free memory was 203.5MB in the beginning and 191.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 13:22:04,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.33ms. Allocated memory is still 227.5MB. Free memory was 191.5MB in the beginning and 189.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 13:22:04,339 INFO L158 Benchmark]: Boogie Preprocessor took 37.91ms. Allocated memory is still 227.5MB. Free memory was 189.9MB in the beginning and 188.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 13:22:04,340 INFO L158 Benchmark]: RCFGBuilder took 412.12ms. Allocated memory is still 227.5MB. Free memory was 187.8MB in the beginning and 167.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-13 13:22:04,340 INFO L158 Benchmark]: TraceAbstraction took 25371.08ms. Allocated memory was 227.5MB in the beginning and 500.2MB in the end (delta: 272.6MB). Free memory was 166.3MB in the beginning and 186.5MB in the end (delta: -20.2MB). Peak memory consumption was 252.9MB. Max. memory is 8.0GB. [2022-12-13 13:22:04,341 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.10ms. Allocated memory is still 227.5MB. Free memory is still 205.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.96ms. Allocated memory is still 227.5MB. Free memory was 203.5MB in the beginning and 191.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.33ms. Allocated memory is still 227.5MB. Free memory was 191.5MB in the beginning and 189.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.91ms. Allocated memory is still 227.5MB. Free memory was 189.9MB in the beginning and 188.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 412.12ms. Allocated memory is still 227.5MB. Free memory was 187.8MB in the beginning and 167.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 25371.08ms. Allocated memory was 227.5MB in the beginning and 500.2MB in the end (delta: 272.6MB). Free memory was 166.3MB in the beginning and 186.5MB in the end (delta: -20.2MB). Peak memory consumption was 252.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 126 PlacesBefore, 30 PlacesAfterwards, 128 TransitionsBefore, 24 TransitionsAfterwards, 1320 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 66 TrivialYvCompositions, 30 ConcurrentYvCompositions, 8 ChoiceCompositions, 104 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 706, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 712, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 712, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 712, unknown conditional: 0, unknown unconditional: 712] , Statistics on independence cache: Total cache size (in pairs): 1132, Positive cache size: 1126, Positive conditional cache size: 0, Positive unconditional cache size: 1126, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 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, 32 PlacesBefore, 31 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 10, independent unconditional: 18, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 29, unknown conditional: 11, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 28, Positive conditional cache size: 10, Positive unconditional cache size: 18, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 36 PlacesBefore, 34 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 238 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): 29, Positive cache size: 28, Positive conditional cache size: 10, Positive unconditional cache size: 18, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 39 PlacesBefore, 38 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 58, independent: 58, independent conditional: 58, 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: 58, independent: 58, independent conditional: 30, 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: 58, independent: 58, independent conditional: 30, 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: 58, independent: 58, independent conditional: 30, 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: 17, independent: 17, independent conditional: 10, 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: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, independent: 41, independent conditional: 20, independent unconditional: 21, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 10, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 48, Positive conditional cache size: 23, Positive unconditional cache size: 25, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 51 PlacesBefore, 50 PlacesAfterwards, 72 TransitionsBefore, 71 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 61, Positive conditional cache size: 34, Positive unconditional cache size: 27, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 61 TransitionsBefore, 61 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): 62, Positive cache size: 61, Positive conditional cache size: 34, Positive unconditional cache size: 27, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 52 PlacesBefore, 53 PlacesAfterwards, 55 TransitionsBefore, 59 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 210, independent conditional: 210, 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: 210, independent: 210, independent conditional: 140, independent unconditional: 70, 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: 210, independent: 210, independent conditional: 140, independent unconditional: 70, 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: 210, independent: 210, independent conditional: 140, independent unconditional: 70, 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: 13, 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: 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: 210, independent: 188, independent conditional: 127, independent unconditional: 61, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 13, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 83, Positive conditional cache size: 47, Positive unconditional cache size: 36, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 59 PlacesBefore, 57 PlacesAfterwards, 70 TransitionsBefore, 68 TransitionsAfterwards, 440 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, 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: 47, independent: 47, independent conditional: 40, independent unconditional: 7, 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: 47, independent: 47, independent conditional: 31, independent unconditional: 16, 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: 47, independent: 47, independent conditional: 31, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 6, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, independent: 35, independent conditional: 25, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 99, Positive conditional cache size: 55, Positive unconditional cache size: 44, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 380 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): 100, Positive cache size: 99, Positive conditional cache size: 55, Positive unconditional cache size: 44, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 59 PlacesBefore, 58 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, 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: 38, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 181, Positive conditional cache size: 133, Positive unconditional cache size: 48, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 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): 182, Positive cache size: 181, Positive conditional cache size: 133, Positive unconditional cache size: 48, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 100]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 25.3s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 583 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 583 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 133 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1475 IncrementalHoareTripleChecker+Invalid, 1687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 15 mSDtfsCounter, 1475 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 96 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 309 ConstructedInterpolants, 9 QuantifiedInterpolants, 3220 SizeOfPredicates, 43 NumberOfNonLiveVariables, 610 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 13:22:04,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...