/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-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:52:01,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:52:01,190 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:52:01,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:52:01,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:52:01,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:52:01,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:52:01,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:52:01,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:52:01,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:52:01,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:52:01,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:52:01,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:52:01,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:52:01,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:52:01,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:52:01,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:52:01,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:52:01,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:52:01,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:52:01,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:52:01,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:52:01,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:52:01,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:52:01,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:52:01,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:52:01,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:52:01,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:52:01,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:52:01,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:52:01,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:52:01,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:52:01,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:52:01,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:52:01,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:52:01,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:52:01,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:52:01,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:52:01,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:52:01,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:52:01,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:52:01,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:52:01,295 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:52:01,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:52:01,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:52:01,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:52:01,297 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:52:01,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:52:01,298 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:52:01,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:52:01,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:52:01,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:52:01,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:52:01,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:52:01,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:52:01,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:52:01,301 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:52:01,301 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 07:52:01,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:52:01,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:52:01,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:52:01,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:52:01,553 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:52:01,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-06 07:52:02,437 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:52:02,626 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:52:02,627 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-06 07:52:02,637 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd3874b9/08ff139c0001466fbed06a2caf8c9aaf/FLAG0d8ef643e [2022-12-06 07:52:02,648 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dd3874b9/08ff139c0001466fbed06a2caf8c9aaf [2022-12-06 07:52:02,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:52:02,650 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:52:02,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:52:02,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:52:02,653 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:52:02,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e596ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02, skipping insertion in model container [2022-12-06 07:52:02,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:52:02,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:52:02,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:52:02,806 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:52:02,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:52:02,810 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:52:02,818 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-simple-queue.wvr.c[2438,2451] [2022-12-06 07:52:02,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:52:02,835 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:52:02,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:52:02,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:52:02,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:52:02,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:52:02,866 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-simple-queue.wvr.c[2438,2451] [2022-12-06 07:52:02,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:52:02,877 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:52:02,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02 WrapperNode [2022-12-06 07:52:02,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:52:02,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:52:02,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:52:02,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:52:02,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,921 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 128 [2022-12-06 07:52:02,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:52:02,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:52:02,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:52:02,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:52:02,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,941 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,952 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,956 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:52:02,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:52:02,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:52:02,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:52:02,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (1/1) ... [2022-12-06 07:52:02,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:52:02,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:03,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 07:52:03,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 07:52:03,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:52:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:52:03,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:52:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:52:03,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:52:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:52:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:52:03,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:52:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:52:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:52:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:52:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:52:03,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:52:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:52:03,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:52:03,041 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:52:03,168 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:52:03,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:52:03,365 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:52:03,411 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:52:03,411 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:52:03,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:52:03 BoogieIcfgContainer [2022-12-06 07:52:03,413 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:52:03,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:52:03,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:52:03,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:52:03,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:52:02" (1/3) ... [2022-12-06 07:52:03,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741cc6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:52:03, skipping insertion in model container [2022-12-06 07:52:03,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:52:02" (2/3) ... [2022-12-06 07:52:03,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741cc6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:52:03, skipping insertion in model container [2022-12-06 07:52:03,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:52:03" (3/3) ... [2022-12-06 07:52:03,418 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2022-12-06 07:52:03,435 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:52:03,435 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:52:03,435 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:52:03,495 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:52:03,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 236 flow [2022-12-06 07:52:03,584 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2022-12-06 07:52:03,584 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:52:03,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 07:52:03,590 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 110 transitions, 236 flow [2022-12-06 07:52:03,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 100 transitions, 212 flow [2022-12-06 07:52:03,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:03,611 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-06 07:52:03,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 100 transitions, 212 flow [2022-12-06 07:52:03,646 INFO L130 PetriNetUnfolder]: 9/100 cut-off events. [2022-12-06 07:52:03,646 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:52:03,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 07:52:03,649 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-06 07:52:03,649 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 07:52:07,088 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-06 07:52:07,098 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:52:07,103 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;@bd579bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:52:07,103 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:52:07,107 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 07:52:07,107 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:52:07,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:07,108 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:07,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1143381871, now seen corresponding path program 1 times [2022-12-06 07:52:07,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:07,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800961078] [2022-12-06 07:52:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:07,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:07,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800961078] [2022-12-06 07:52:07,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800961078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:07,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:07,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:52:07,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803765736] [2022-12-06 07:52:07,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:07,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:52:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:52:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:52:07,381 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:52:07,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:07,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:07,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:52:07,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:07,426 INFO L130 PetriNetUnfolder]: 38/71 cut-off events. [2022-12-06 07:52:07,426 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 07:52:07,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 71 events. 38/71 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 9 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 100. Up to 37 conditions per place. [2022-12-06 07:52:07,428 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2022-12-06 07:52:07,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 110 flow [2022-12-06 07:52:07,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:52:07,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:52:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 07:52:07,435 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 07:52:07,437 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 24 transitions. [2022-12-06 07:52:07,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 110 flow [2022-12-06 07:52:07,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:52:07,441 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 46 flow [2022-12-06 07:52:07,442 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2022-12-06 07:52:07,445 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-06 07:52:07,445 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:07,445 INFO L89 Accepts]: Start accepts. Operand has 18 places, 16 transitions, 46 flow [2022-12-06 07:52:07,447 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:07,447 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:07,447 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 16 transitions, 46 flow [2022-12-06 07:52:07,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 16 transitions, 46 flow [2022-12-06 07:52:07,451 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 07:52:07,452 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:52:07,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2022-12-06 07:52:07,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 16 transitions, 46 flow [2022-12-06 07:52:07,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 07:52:07,452 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:07,453 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 07:52:07,454 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 46 flow [2022-12-06 07:52:07,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:07,454 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:07,454 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:07,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:52:07,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:07,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:07,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1742405358, now seen corresponding path program 1 times [2022-12-06 07:52:07,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:07,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186085428] [2022-12-06 07:52:07,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:07,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:07,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:07,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186085428] [2022-12-06 07:52:07,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186085428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:07,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:07,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:52:07,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625690138] [2022-12-06 07:52:07,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:07,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:52:07,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:07,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:52:07,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:52:07,584 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:52:07,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:07,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:07,584 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:52:07,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:07,627 INFO L130 PetriNetUnfolder]: 52/102 cut-off events. [2022-12-06 07:52:07,627 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:52:07,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 102 events. 52/102 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 246 event pairs, 17 based on Foata normal form. 6/91 useless extension candidates. Maximal degree in co-relation 135. Up to 74 conditions per place. [2022-12-06 07:52:07,628 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 18 selfloop transitions, 2 changer transitions 5/25 dead transitions. [2022-12-06 07:52:07,628 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 25 transitions, 117 flow [2022-12-06 07:52:07,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:52:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:52:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 07:52:07,630 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 07:52:07,630 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 46 flow. Second operand 3 states and 25 transitions. [2022-12-06 07:52:07,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 25 transitions, 117 flow [2022-12-06 07:52:07,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:07,631 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 56 flow [2022-12-06 07:52:07,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2022-12-06 07:52:07,632 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 1 predicate places. [2022-12-06 07:52:07,632 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:07,632 INFO L89 Accepts]: Start accepts. Operand has 20 places, 17 transitions, 56 flow [2022-12-06 07:52:07,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:07,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:07,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 17 transitions, 56 flow [2022-12-06 07:52:07,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 56 flow [2022-12-06 07:52:07,637 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 07:52:07,637 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:52:07,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 24 events. 4/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 5 conditions per place. [2022-12-06 07:52:07,638 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 17 transitions, 56 flow [2022-12-06 07:52:07,638 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 07:52:07,638 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:07,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 07:52:07,639 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 56 flow [2022-12-06 07:52:07,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:07,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:07,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:07,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:52:07,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash 253712065, now seen corresponding path program 1 times [2022-12-06 07:52:07,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:07,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779449596] [2022-12-06 07:52:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:07,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:52:07,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:07,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779449596] [2022-12-06 07:52:07,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779449596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:07,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:52:07,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:52:07,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632386469] [2022-12-06 07:52:07,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:07,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:52:07,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:07,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:52:07,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:52:07,790 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:52:07,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:07,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:07,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:52:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:07,839 INFO L130 PetriNetUnfolder]: 61/130 cut-off events. [2022-12-06 07:52:07,839 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 07:52:07,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 130 events. 61/130 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 354 event pairs, 44 based on Foata normal form. 6/134 useless extension candidates. Maximal degree in co-relation 212. Up to 103 conditions per place. [2022-12-06 07:52:07,840 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 10/28 dead transitions. [2022-12-06 07:52:07,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 138 flow [2022-12-06 07:52:07,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:52:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:52:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 07:52:07,841 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 07:52:07,841 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 56 flow. Second operand 4 states and 27 transitions. [2022-12-06 07:52:07,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 138 flow [2022-12-06 07:52:07,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 28 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:07,842 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 68 flow [2022-12-06 07:52:07,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2022-12-06 07:52:07,843 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-06 07:52:07,843 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:07,843 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 68 flow [2022-12-06 07:52:07,844 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:07,844 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:07,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 68 flow [2022-12-06 07:52:07,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 68 flow [2022-12-06 07:52:07,847 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 07:52:07,847 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:52:07,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 35. Up to 5 conditions per place. [2022-12-06 07:52:07,847 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 68 flow [2022-12-06 07:52:07,847 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 07:52:08,560 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:08,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 718 [2022-12-06 07:52:08,561 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 64 flow [2022-12-06 07:52:08,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:08,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:08,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:08,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:52:08,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1524411168, now seen corresponding path program 1 times [2022-12-06 07:52:08,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:08,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544803360] [2022-12-06 07:52:08,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:08,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:08,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544803360] [2022-12-06 07:52:08,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544803360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:08,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791482735] [2022-12-06 07:52:08,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:08,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:08,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:08,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:08,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 07:52:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:08,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 07:52:08,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:09,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 07:52:09,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:52:09,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:52:09,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:52:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:09,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:09,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791482735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:09,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:09,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-12-06 07:52:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660645646] [2022-12-06 07:52:09,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 07:52:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:09,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 07:52:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=111, Unknown=1, NotChecked=0, Total=156 [2022-12-06 07:52:09,312 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 07:52:09,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 64 flow. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:09,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:09,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 07:52:09,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:11,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:52:11,771 INFO L130 PetriNetUnfolder]: 176/343 cut-off events. [2022-12-06 07:52:11,772 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-06 07:52:11,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 343 events. 176/343 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1434 event pairs, 30 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 855. Up to 111 conditions per place. [2022-12-06 07:52:11,774 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 47 selfloop transitions, 20 changer transitions 16/83 dead transitions. [2022-12-06 07:52:11,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 83 transitions, 429 flow [2022-12-06 07:52:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:52:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:52:11,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-12-06 07:52:11,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-06 07:52:11,779 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 64 flow. Second operand 11 states and 81 transitions. [2022-12-06 07:52:11,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 83 transitions, 429 flow [2022-12-06 07:52:11,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 83 transitions, 405 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 07:52:11,781 INFO L231 Difference]: Finished difference. Result has 32 places, 36 transitions, 195 flow [2022-12-06 07:52:11,781 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=195, PETRI_PLACES=32, PETRI_TRANSITIONS=36} [2022-12-06 07:52:11,781 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 13 predicate places. [2022-12-06 07:52:11,781 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:11,781 INFO L89 Accepts]: Start accepts. Operand has 32 places, 36 transitions, 195 flow [2022-12-06 07:52:11,782 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:11,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:11,782 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 36 transitions, 195 flow [2022-12-06 07:52:11,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 36 transitions, 195 flow [2022-12-06 07:52:11,791 INFO L130 PetriNetUnfolder]: 17/94 cut-off events. [2022-12-06 07:52:11,791 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 07:52:11,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 94 events. 17/94 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 422 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 138. Up to 22 conditions per place. [2022-12-06 07:52:11,796 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 36 transitions, 195 flow [2022-12-06 07:52:11,796 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:52:15,381 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:15,382 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:15,382 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:15,382 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:15,467 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:52:15,467 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3686 [2022-12-06 07:52:15,467 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 204 flow [2022-12-06 07:52:15,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:15,468 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:15,468 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:15,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 07:52:15,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:15,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:15,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:15,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1639294692, now seen corresponding path program 1 times [2022-12-06 07:52:15,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:15,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765061329] [2022-12-06 07:52:15,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:15,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:16,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:16,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:16,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765061329] [2022-12-06 07:52:16,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765061329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:16,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205757027] [2022-12-06 07:52:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:16,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:16,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:52:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:16,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:52:16,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:16,136 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 19 treesize of output 19 [2022-12-06 07:52:16,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:52:16,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:16,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:52:16,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:16,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:16,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:16,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 5)) is different from false [2022-12-06 07:52:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 07:52:16,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205757027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:16,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:16,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 07:52:16,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687683524] [2022-12-06 07:52:16,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:16,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 07:52:16,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:16,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 07:52:16,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=1, NotChecked=18, Total=132 [2022-12-06 07:52:16,304 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:52:16,304 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 35 transitions, 204 flow. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:16,304 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:16,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:52:16,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:18,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:52:18,989 INFO L130 PetriNetUnfolder]: 355/669 cut-off events. [2022-12-06 07:52:18,989 INFO L131 PetriNetUnfolder]: For 775/775 co-relation queries the response was YES. [2022-12-06 07:52:18,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 669 events. 355/669 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3202 event pairs, 72 based on Foata normal form. 3/668 useless extension candidates. Maximal degree in co-relation 781. Up to 207 conditions per place. [2022-12-06 07:52:18,993 INFO L137 encePairwiseOnDemand]: 4/19 looper letters, 72 selfloop transitions, 40 changer transitions 23/135 dead transitions. [2022-12-06 07:52:18,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 135 transitions, 831 flow [2022-12-06 07:52:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 07:52:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 07:52:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 129 transitions. [2022-12-06 07:52:18,997 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4243421052631579 [2022-12-06 07:52:18,997 INFO L175 Difference]: Start difference. First operand has 31 places, 35 transitions, 204 flow. Second operand 16 states and 129 transitions. [2022-12-06 07:52:18,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 135 transitions, 831 flow [2022-12-06 07:52:19,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 135 transitions, 815 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:19,005 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 505 flow [2022-12-06 07:52:19,005 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=505, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2022-12-06 07:52:19,007 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 34 predicate places. [2022-12-06 07:52:19,007 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:19,007 INFO L89 Accepts]: Start accepts. Operand has 53 places, 59 transitions, 505 flow [2022-12-06 07:52:19,009 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:19,009 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:19,011 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 59 transitions, 505 flow [2022-12-06 07:52:19,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 59 transitions, 505 flow [2022-12-06 07:52:19,033 INFO L130 PetriNetUnfolder]: 113/328 cut-off events. [2022-12-06 07:52:19,034 INFO L131 PetriNetUnfolder]: For 759/793 co-relation queries the response was YES. [2022-12-06 07:52:19,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 328 events. 113/328 cut-off events. For 759/793 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1896 event pairs, 37 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 926. Up to 133 conditions per place. [2022-12-06 07:52:19,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 59 transitions, 505 flow [2022-12-06 07:52:19,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 200 [2022-12-06 07:52:19,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 07:52:19,151 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:52:19,219 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [379] L81-4-->L82-1: Formula: (= (select (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t1~0#1.base_11|) |v_ULTIMATE.start_main_~#t1~0#1.offset_11|) |v_ULTIMATE.start_main_#t~mem14#1_10|) InVars {#memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_15|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:52:19,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] L52-->L82-1: Formula: (and (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_48| 256) 0)) (= (ite (= (select (select |v_#memory_int_155| v_~queue~0.base_90) (+ (* v_~back~0_109 4) v_~queue~0.offset_90)) 5) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= (select (select |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_53|) |v_ULTIMATE.start_main_#t~mem14#1_48|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19| 0)) (not (= 0 (ite (and (<= 0 v_~back~0_109) (< v_~back~0_109 v_~n~0_82)) 1 0))) (= v_~back~0_108 (+ v_~back~0_109 1))) InVars {~queue~0.offset=v_~queue~0.offset_90, #memory_int=|v_#memory_int_155|, ~back~0=v_~back~0_109, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_48|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_90, ~n~0=v_~n~0_82, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|} OutVars{~queue~0.offset=v_~queue~0.offset_90, ~back~0=v_~back~0_108, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_19|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_90, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_57|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_48|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_19|, #memory_int=|v_#memory_int_155|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, ~n~0=v_~n~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem14#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 07:52:19,387 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:52:19,387 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 380 [2022-12-06 07:52:19,387 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 59 transitions, 532 flow [2022-12-06 07:52:19,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:19,388 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:19,388 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:19,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:19,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:19,594 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash 911938125, now seen corresponding path program 1 times [2022-12-06 07:52:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:19,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549065774] [2022-12-06 07:52:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:20,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549065774] [2022-12-06 07:52:20,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549065774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:20,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105648210] [2022-12-06 07:52:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:20,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:20,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:20,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:20,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:52:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:20,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 07:52:20,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:20,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:20,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:52:20,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:20,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:20,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:20,419 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 42 treesize of output 38 [2022-12-06 07:52:20,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-06 07:52:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:20,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105648210] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:20,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:20,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 07:52:20,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922283169] [2022-12-06 07:52:20,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:20,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 07:52:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:20,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 07:52:20,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=143, Unknown=5, NotChecked=0, Total=182 [2022-12-06 07:52:20,465 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:52:20,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 59 transitions, 532 flow. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:20,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:20,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:52:20,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:20,784 INFO L130 PetriNetUnfolder]: 423/823 cut-off events. [2022-12-06 07:52:20,784 INFO L131 PetriNetUnfolder]: For 3314/3314 co-relation queries the response was YES. [2022-12-06 07:52:20,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3921 conditions, 823 events. 423/823 cut-off events. For 3314/3314 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4418 event pairs, 96 based on Foata normal form. 7/828 useless extension candidates. Maximal degree in co-relation 3114. Up to 313 conditions per place. [2022-12-06 07:52:20,788 INFO L137 encePairwiseOnDemand]: 9/20 looper letters, 60 selfloop transitions, 34 changer transitions 21/115 dead transitions. [2022-12-06 07:52:20,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 115 transitions, 1129 flow [2022-12-06 07:52:20,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:52:20,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:52:20,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-12-06 07:52:20,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 07:52:20,790 INFO L175 Difference]: Start difference. First operand has 52 places, 59 transitions, 532 flow. Second operand 8 states and 76 transitions. [2022-12-06 07:52:20,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 115 transitions, 1129 flow [2022-12-06 07:52:20,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 1052 flow, removed 36 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:20,802 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 628 flow [2022-12-06 07:52:20,802 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=628, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2022-12-06 07:52:20,804 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 41 predicate places. [2022-12-06 07:52:20,804 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:20,804 INFO L89 Accepts]: Start accepts. Operand has 60 places, 66 transitions, 628 flow [2022-12-06 07:52:20,805 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:20,805 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:20,805 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 66 transitions, 628 flow [2022-12-06 07:52:20,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 66 transitions, 628 flow [2022-12-06 07:52:20,833 INFO L130 PetriNetUnfolder]: 131/409 cut-off events. [2022-12-06 07:52:20,833 INFO L131 PetriNetUnfolder]: For 1164/1198 co-relation queries the response was YES. [2022-12-06 07:52:20,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 409 events. 131/409 cut-off events. For 1164/1198 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2656 event pairs, 50 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 1212. Up to 169 conditions per place. [2022-12-06 07:52:20,836 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 66 transitions, 628 flow [2022-12-06 07:52:20,836 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 07:52:20,837 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:20,838 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 07:52:20,838 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 628 flow [2022-12-06 07:52:20,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:20,838 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:20,838 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:20,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:21,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:21,043 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:21,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1352723602, now seen corresponding path program 1 times [2022-12-06 07:52:21,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:21,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520083747] [2022-12-06 07:52:21,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:21,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:21,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:21,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:21,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520083747] [2022-12-06 07:52:21,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520083747] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:21,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111712163] [2022-12-06 07:52:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:21,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:21,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:21,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:21,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 07:52:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:21,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 07:52:21,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:21,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:21,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111712163] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:21,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:21,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2022-12-06 07:52:21,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700289535] [2022-12-06 07:52:21,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:21,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:52:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:21,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:52:21,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:52:21,284 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:52:21,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 628 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:21,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:21,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:52:21,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:21,468 INFO L130 PetriNetUnfolder]: 641/1262 cut-off events. [2022-12-06 07:52:21,469 INFO L131 PetriNetUnfolder]: For 6857/6857 co-relation queries the response was YES. [2022-12-06 07:52:21,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6244 conditions, 1262 events. 641/1262 cut-off events. For 6857/6857 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7502 event pairs, 209 based on Foata normal form. 42/1304 useless extension candidates. Maximal degree in co-relation 3702. Up to 542 conditions per place. [2022-12-06 07:52:21,474 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 66 selfloop transitions, 32 changer transitions 2/100 dead transitions. [2022-12-06 07:52:21,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 1134 flow [2022-12-06 07:52:21,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:52:21,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:52:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 07:52:21,476 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 07:52:21,476 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 628 flow. Second operand 4 states and 42 transitions. [2022-12-06 07:52:21,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 1134 flow [2022-12-06 07:52:21,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 1085 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 07:52:21,484 INFO L231 Difference]: Finished difference. Result has 60 places, 78 transitions, 911 flow [2022-12-06 07:52:21,484 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=911, PETRI_PLACES=60, PETRI_TRANSITIONS=78} [2022-12-06 07:52:21,485 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 41 predicate places. [2022-12-06 07:52:21,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:21,485 INFO L89 Accepts]: Start accepts. Operand has 60 places, 78 transitions, 911 flow [2022-12-06 07:52:21,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:21,486 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:21,486 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 78 transitions, 911 flow [2022-12-06 07:52:21,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 78 transitions, 911 flow [2022-12-06 07:52:21,522 INFO L130 PetriNetUnfolder]: 186/596 cut-off events. [2022-12-06 07:52:21,522 INFO L131 PetriNetUnfolder]: For 1851/1945 co-relation queries the response was YES. [2022-12-06 07:52:21,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 596 events. 186/596 cut-off events. For 1851/1945 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4359 event pairs, 70 based on Foata normal form. 0/558 useless extension candidates. Maximal degree in co-relation 1515. Up to 247 conditions per place. [2022-12-06 07:52:21,527 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 78 transitions, 911 flow [2022-12-06 07:52:21,527 INFO L188 LiptonReduction]: Number of co-enabled transitions 310 [2022-12-06 07:52:23,598 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:23,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2113 [2022-12-06 07:52:23,599 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 78 transitions, 911 flow [2022-12-06 07:52:23,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:23,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:23,599 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:23,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:23,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:23,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1094805153, now seen corresponding path program 1 times [2022-12-06 07:52:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:23,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549826453] [2022-12-06 07:52:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:23,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:23,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549826453] [2022-12-06 07:52:23,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549826453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:23,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863467306] [2022-12-06 07:52:23,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:23,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:23,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 07:52:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:23,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:52:23,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:23,942 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:52:23,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863467306] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:23,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:52:23,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:52:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542043957] [2022-12-06 07:52:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:23,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:52:23,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:52:23,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:52:23,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 07:52:23,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 78 transitions, 911 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:23,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:23,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 07:52:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:24,067 INFO L130 PetriNetUnfolder]: 428/872 cut-off events. [2022-12-06 07:52:24,067 INFO L131 PetriNetUnfolder]: For 5491/5491 co-relation queries the response was YES. [2022-12-06 07:52:24,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4532 conditions, 872 events. 428/872 cut-off events. For 5491/5491 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4891 event pairs, 319 based on Foata normal form. 17/889 useless extension candidates. Maximal degree in co-relation 3841. Up to 718 conditions per place. [2022-12-06 07:52:24,072 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 41 selfloop transitions, 0 changer transitions 24/65 dead transitions. [2022-12-06 07:52:24,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 801 flow [2022-12-06 07:52:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:52:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:52:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 07:52:24,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4875 [2022-12-06 07:52:24,073 INFO L175 Difference]: Start difference. First operand has 60 places, 78 transitions, 911 flow. Second operand 4 states and 39 transitions. [2022-12-06 07:52:24,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 801 flow [2022-12-06 07:52:24,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 65 transitions, 710 flow, removed 36 selfloop flow, removed 6 redundant places. [2022-12-06 07:52:24,081 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 412 flow [2022-12-06 07:52:24,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-12-06 07:52:24,082 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 34 predicate places. [2022-12-06 07:52:24,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:24,083 INFO L89 Accepts]: Start accepts. Operand has 53 places, 41 transitions, 412 flow [2022-12-06 07:52:24,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:24,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:24,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 41 transitions, 412 flow [2022-12-06 07:52:24,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 41 transitions, 412 flow [2022-12-06 07:52:24,111 INFO L130 PetriNetUnfolder]: 59/249 cut-off events. [2022-12-06 07:52:24,111 INFO L131 PetriNetUnfolder]: For 274/288 co-relation queries the response was YES. [2022-12-06 07:52:24,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 249 events. 59/249 cut-off events. For 274/288 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1563 event pairs, 38 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 389. Up to 111 conditions per place. [2022-12-06 07:52:24,113 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 41 transitions, 412 flow [2022-12-06 07:52:24,113 INFO L188 LiptonReduction]: Number of co-enabled transitions 192 [2022-12-06 07:52:24,114 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:24,115 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 07:52:24,115 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 412 flow [2022-12-06 07:52:24,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:24,116 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:24,116 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:24,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:24,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:24,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:24,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2376687, now seen corresponding path program 1 times [2022-12-06 07:52:24,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:24,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933503640] [2022-12-06 07:52:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933503640] [2022-12-06 07:52:24,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933503640] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377175375] [2022-12-06 07:52:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:24,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:24,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:24,606 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:24,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 07:52:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:24,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-06 07:52:24,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:24,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:24,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:24,829 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:52:24,830 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 25 treesize of output 17 [2022-12-06 07:52:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:24,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377175375] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:24,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:24,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-06 07:52:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888648248] [2022-12-06 07:52:24,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:24,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:52:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:24,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:52:24,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-06 07:52:24,880 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:52:24,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 412 flow. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:24,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:24,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:52:24,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:25,768 INFO L130 PetriNetUnfolder]: 900/1688 cut-off events. [2022-12-06 07:52:25,768 INFO L131 PetriNetUnfolder]: For 5490/5490 co-relation queries the response was YES. [2022-12-06 07:52:25,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6839 conditions, 1688 events. 900/1688 cut-off events. For 5490/5490 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10099 event pairs, 71 based on Foata normal form. 11/1699 useless extension candidates. Maximal degree in co-relation 2458. Up to 703 conditions per place. [2022-12-06 07:52:25,777 INFO L137 encePairwiseOnDemand]: 10/16 looper letters, 153 selfloop transitions, 72 changer transitions 63/288 dead transitions. [2022-12-06 07:52:25,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 288 transitions, 2349 flow [2022-12-06 07:52:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 07:52:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 07:52:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 269 transitions. [2022-12-06 07:52:25,779 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5604166666666667 [2022-12-06 07:52:25,779 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 412 flow. Second operand 30 states and 269 transitions. [2022-12-06 07:52:25,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 288 transitions, 2349 flow [2022-12-06 07:52:25,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 288 transitions, 2233 flow, removed 58 selfloop flow, removed 2 redundant places. [2022-12-06 07:52:25,789 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 1254 flow [2022-12-06 07:52:25,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1254, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2022-12-06 07:52:25,789 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 71 predicate places. [2022-12-06 07:52:25,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:25,789 INFO L89 Accepts]: Start accepts. Operand has 90 places, 92 transitions, 1254 flow [2022-12-06 07:52:25,792 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:25,792 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:25,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 92 transitions, 1254 flow [2022-12-06 07:52:25,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 92 transitions, 1254 flow [2022-12-06 07:52:25,834 INFO L130 PetriNetUnfolder]: 137/565 cut-off events. [2022-12-06 07:52:25,834 INFO L131 PetriNetUnfolder]: For 2840/2934 co-relation queries the response was YES. [2022-12-06 07:52:25,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 565 events. 137/565 cut-off events. For 2840/2934 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4545 event pairs, 84 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 1614. Up to 237 conditions per place. [2022-12-06 07:52:25,839 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 92 transitions, 1254 flow [2022-12-06 07:52:25,839 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 07:52:25,840 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:25,840 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:25,840 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:25,840 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:25,943 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:25,943 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,036 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,036 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,036 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,036 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,143 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,143 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,220 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,220 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,290 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,291 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,382 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,383 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,462 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:52:26,526 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,526 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,526 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,526 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,614 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L52-->L81-3: Formula: (and (= (ite (= 5 (select (select |v_#memory_int_201| v_~queue~0.base_122) (+ (* v_~back~0_170 4) v_~queue~0.offset_122))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|) (= |v_#pthreadsForks_80| (+ |v_#pthreadsForks_81| 1)) (= (store |v_#memory_int_201| |v_ULTIMATE.start_main_~#t2~0#1.base_61| (store (select |v_#memory_int_201| |v_ULTIMATE.start_main_~#t2~0#1.base_61|) |v_ULTIMATE.start_main_~#t2~0#1.offset_60| |v_ULTIMATE.start_main_#t~pre12#1_76|)) |v_#memory_int_200|) (= |v_ULTIMATE.start_main_#t~pre12#1_76| |v_#pthreadsForks_81|) (= (+ v_~back~0_170 1) v_~back~0_169) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_93| 256) 0)) (not (= (ite (and (< v_~back~0_170 v_~n~0_111) (<= 0 v_~back~0_170)) 1 0) 0))) InVars {~queue~0.offset=v_~queue~0.offset_122, #pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_60|, #memory_int=|v_#memory_int_201|, ~back~0=v_~back~0_170, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_93|, ~queue~0.base=v_~queue~0.base_122, ~n~0=v_~n~0_111, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|} OutVars{~queue~0.offset=v_~queue~0.offset_122, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_60|, ~back~0=v_~back~0_169, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_49|, ~queue~0.base=v_~queue~0.base_122, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_76|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_49|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_59|, #pthreadsForks=|v_#pthreadsForks_80|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_49|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_81|, #memory_int=|v_#memory_int_200|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_49|, ~n~0=v_~n~0_111, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_61|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, ULTIMATE.start_main_#t~pre10#1, ~back~0, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] [2022-12-06 07:52:26,614 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,614 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,614 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,614 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,737 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,737 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,823 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,824 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,824 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,824 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:26,906 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-06 07:52:26,907 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1118 [2022-12-06 07:52:26,907 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 91 transitions, 1302 flow [2022-12-06 07:52:26,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:26,907 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:26,907 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:26,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:27,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:27,111 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:27,112 INFO L85 PathProgramCache]: Analyzing trace with hash -792183677, now seen corresponding path program 2 times [2022-12-06 07:52:27,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:27,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290122754] [2022-12-06 07:52:27,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:27,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:27,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:27,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290122754] [2022-12-06 07:52:27,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290122754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:27,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243399392] [2022-12-06 07:52:27,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:52:27,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:27,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:27,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:27,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 07:52:27,513 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:52:27,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:52:27,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-06 07:52:27,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:27,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:27,570 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 19 treesize of output 21 [2022-12-06 07:52:27,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:27,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:27,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:27,650 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 44 treesize of output 41 [2022-12-06 07:52:27,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 07:52:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243399392] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:27,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:27,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 07:52:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689121939] [2022-12-06 07:52:27,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:27,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:52:27,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:52:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:52:27,691 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:52:27,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 1302 flow. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:27,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:27,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:52:27,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:28,285 INFO L130 PetriNetUnfolder]: 1071/2006 cut-off events. [2022-12-06 07:52:28,285 INFO L131 PetriNetUnfolder]: For 20403/20403 co-relation queries the response was YES. [2022-12-06 07:52:28,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10293 conditions, 2006 events. 1071/2006 cut-off events. For 20403/20403 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12439 event pairs, 304 based on Foata normal form. 4/1997 useless extension candidates. Maximal degree in co-relation 9665. Up to 805 conditions per place. [2022-12-06 07:52:28,297 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 102 selfloop transitions, 62 changer transitions 34/198 dead transitions. [2022-12-06 07:52:28,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 198 transitions, 2490 flow [2022-12-06 07:52:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:52:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:52:28,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2022-12-06 07:52:28,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.33418367346938777 [2022-12-06 07:52:28,298 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 1302 flow. Second operand 14 states and 131 transitions. [2022-12-06 07:52:28,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 198 transitions, 2490 flow [2022-12-06 07:52:28,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 198 transitions, 2147 flow, removed 166 selfloop flow, removed 3 redundant places. [2022-12-06 07:52:28,331 INFO L231 Difference]: Finished difference. Result has 101 places, 105 transitions, 1379 flow [2022-12-06 07:52:28,331 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1379, PETRI_PLACES=101, PETRI_TRANSITIONS=105} [2022-12-06 07:52:28,332 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 82 predicate places. [2022-12-06 07:52:28,332 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:28,332 INFO L89 Accepts]: Start accepts. Operand has 101 places, 105 transitions, 1379 flow [2022-12-06 07:52:28,333 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:28,333 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:28,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 105 transitions, 1379 flow [2022-12-06 07:52:28,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 105 transitions, 1379 flow [2022-12-06 07:52:28,377 INFO L130 PetriNetUnfolder]: 163/672 cut-off events. [2022-12-06 07:52:28,377 INFO L131 PetriNetUnfolder]: For 3627/3725 co-relation queries the response was YES. [2022-12-06 07:52:28,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2123 conditions, 672 events. 163/672 cut-off events. For 3627/3725 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5688 event pairs, 101 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 1848. Up to 284 conditions per place. [2022-12-06 07:52:28,382 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 105 transitions, 1379 flow [2022-12-06 07:52:28,382 INFO L188 LiptonReduction]: Number of co-enabled transitions 638 [2022-12-06 07:52:28,383 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:28,383 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-06 07:52:28,384 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 105 transitions, 1379 flow [2022-12-06 07:52:28,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:28,384 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:28,384 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:28,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:28,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:28,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1722694028, now seen corresponding path program 1 times [2022-12-06 07:52:28,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:28,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81610116] [2022-12-06 07:52:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:52:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81610116] [2022-12-06 07:52:28,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81610116] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:28,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277064270] [2022-12-06 07:52:28,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:28,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:28,676 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:28,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 07:52:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:28,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 07:52:28,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:52:28,780 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:52:28,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277064270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:28,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:52:28,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:52:28,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141293536] [2022-12-06 07:52:28,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:28,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:52:28,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:28,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:52:28,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:52:28,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 07:52:28,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 105 transitions, 1379 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:28,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:28,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 07:52:28,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:29,018 INFO L130 PetriNetUnfolder]: 1047/1981 cut-off events. [2022-12-06 07:52:29,018 INFO L131 PetriNetUnfolder]: For 18969/18969 co-relation queries the response was YES. [2022-12-06 07:52:29,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9661 conditions, 1981 events. 1047/1981 cut-off events. For 18969/18969 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 12390 event pairs, 694 based on Foata normal form. 24/2005 useless extension candidates. Maximal degree in co-relation 9121. Up to 1258 conditions per place. [2022-12-06 07:52:29,030 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 100 selfloop transitions, 1 changer transitions 18/119 dead transitions. [2022-12-06 07:52:29,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 119 transitions, 1684 flow [2022-12-06 07:52:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:52:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:52:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 07:52:29,031 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 07:52:29,031 INFO L175 Difference]: Start difference. First operand has 101 places, 105 transitions, 1379 flow. Second operand 4 states and 48 transitions. [2022-12-06 07:52:29,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 119 transitions, 1684 flow [2022-12-06 07:52:29,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 119 transitions, 1647 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:29,059 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 1118 flow [2022-12-06 07:52:29,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1118, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2022-12-06 07:52:29,060 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 84 predicate places. [2022-12-06 07:52:29,060 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:29,060 INFO L89 Accepts]: Start accepts. Operand has 103 places, 87 transitions, 1118 flow [2022-12-06 07:52:29,061 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:29,061 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:29,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 87 transitions, 1118 flow [2022-12-06 07:52:29,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 1118 flow [2022-12-06 07:52:29,095 INFO L130 PetriNetUnfolder]: 139/592 cut-off events. [2022-12-06 07:52:29,095 INFO L131 PetriNetUnfolder]: For 2973/3053 co-relation queries the response was YES. [2022-12-06 07:52:29,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 592 events. 139/592 cut-off events. For 2973/3053 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4764 event pairs, 92 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 1755. Up to 258 conditions per place. [2022-12-06 07:52:29,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 87 transitions, 1118 flow [2022-12-06 07:52:29,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-06 07:52:29,102 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:29,103 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 07:52:29,103 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 1118 flow [2022-12-06 07:52:29,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:29,103 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:29,103 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:29,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:52:29,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-06 07:52:29,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:29,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1152802066, now seen corresponding path program 1 times [2022-12-06 07:52:29,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:29,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076202336] [2022-12-06 07:52:29,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:29,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:29,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076202336] [2022-12-06 07:52:29,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076202336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:29,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897342580] [2022-12-06 07:52:29,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:29,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:29,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:29,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:29,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 07:52:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:29,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:52:29,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:29,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:52:29,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897342580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:52:29,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:52:29,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:52:29,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103038329] [2022-12-06 07:52:29,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:52:29,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:52:29,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:29,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:52:29,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:52:29,479 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 07:52:29,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 1118 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:29,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:29,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 07:52:29,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:29,681 INFO L130 PetriNetUnfolder]: 926/1783 cut-off events. [2022-12-06 07:52:29,681 INFO L131 PetriNetUnfolder]: For 16178/16178 co-relation queries the response was YES. [2022-12-06 07:52:29,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8513 conditions, 1783 events. 926/1783 cut-off events. For 16178/16178 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11019 event pairs, 665 based on Foata normal form. 25/1808 useless extension candidates. Maximal degree in co-relation 8290. Up to 1035 conditions per place. [2022-12-06 07:52:29,693 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 105 selfloop transitions, 2 changer transitions 3/110 dead transitions. [2022-12-06 07:52:29,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 110 transitions, 1553 flow [2022-12-06 07:52:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:52:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:52:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-12-06 07:52:29,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5394736842105263 [2022-12-06 07:52:29,694 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 1118 flow. Second operand 4 states and 41 transitions. [2022-12-06 07:52:29,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 110 transitions, 1553 flow [2022-12-06 07:52:29,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 110 transitions, 1528 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-12-06 07:52:29,716 INFO L231 Difference]: Finished difference. Result has 95 places, 83 transitions, 1064 flow [2022-12-06 07:52:29,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1064, PETRI_PLACES=95, PETRI_TRANSITIONS=83} [2022-12-06 07:52:29,717 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 76 predicate places. [2022-12-06 07:52:29,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:29,717 INFO L89 Accepts]: Start accepts. Operand has 95 places, 83 transitions, 1064 flow [2022-12-06 07:52:29,719 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:29,719 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:29,719 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 83 transitions, 1064 flow [2022-12-06 07:52:29,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 83 transitions, 1064 flow [2022-12-06 07:52:29,753 INFO L130 PetriNetUnfolder]: 137/585 cut-off events. [2022-12-06 07:52:29,753 INFO L131 PetriNetUnfolder]: For 2621/2699 co-relation queries the response was YES. [2022-12-06 07:52:29,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 585 events. 137/585 cut-off events. For 2621/2699 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4739 event pairs, 93 based on Foata normal form. 0/506 useless extension candidates. Maximal degree in co-relation 1523. Up to 258 conditions per place. [2022-12-06 07:52:29,758 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 83 transitions, 1064 flow [2022-12-06 07:52:29,758 INFO L188 LiptonReduction]: Number of co-enabled transitions 474 [2022-12-06 07:52:29,758 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:29,759 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-06 07:52:29,759 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 1064 flow [2022-12-06 07:52:29,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:29,760 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:29,760 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:29,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:29,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:29,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:29,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -116529408, now seen corresponding path program 3 times [2022-12-06 07:52:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:29,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817663695] [2022-12-06 07:52:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:52:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817663695] [2022-12-06 07:52:30,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817663695] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:30,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775604442] [2022-12-06 07:52:30,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 07:52:30,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:30,061 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:30,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 07:52:30,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 07:52:30,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:52:30,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:52:30,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:30,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:30,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2022-12-06 07:52:30,361 INFO L321 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2022-12-06 07:52:30,362 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 35 treesize of output 13 [2022-12-06 07:52:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:30,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:32,601 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-12-06 07:52:32,602 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 54 treesize of output 54 [2022-12-06 07:52:32,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2022-12-06 07:52:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:52:32,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775604442] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:32,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:32,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-06 07:52:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895463546] [2022-12-06 07:52:32,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:32,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:52:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:52:32,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=164, Unknown=2, NotChecked=0, Total=210 [2022-12-06 07:52:32,689 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:52:32,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 1064 flow. Second operand has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:32,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:32,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:52:32,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:33,095 INFO L130 PetriNetUnfolder]: 471/954 cut-off events. [2022-12-06 07:52:33,096 INFO L131 PetriNetUnfolder]: For 8597/8597 co-relation queries the response was YES. [2022-12-06 07:52:33,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 954 events. 471/954 cut-off events. For 8597/8597 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5357 event pairs, 154 based on Foata normal form. 51/1005 useless extension candidates. Maximal degree in co-relation 3790. Up to 397 conditions per place. [2022-12-06 07:52:33,100 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 35 selfloop transitions, 7 changer transitions 65/107 dead transitions. [2022-12-06 07:52:33,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 107 transitions, 1110 flow [2022-12-06 07:52:33,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 07:52:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 07:52:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 86 transitions. [2022-12-06 07:52:33,101 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2022-12-06 07:52:33,101 INFO L175 Difference]: Start difference. First operand has 93 places, 83 transitions, 1064 flow. Second operand 10 states and 86 transitions. [2022-12-06 07:52:33,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 107 transitions, 1110 flow [2022-12-06 07:52:33,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 107 transitions, 991 flow, removed 22 selfloop flow, removed 13 redundant places. [2022-12-06 07:52:33,111 INFO L231 Difference]: Finished difference. Result has 82 places, 37 transitions, 381 flow [2022-12-06 07:52:33,111 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=381, PETRI_PLACES=82, PETRI_TRANSITIONS=37} [2022-12-06 07:52:33,111 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 63 predicate places. [2022-12-06 07:52:33,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:33,111 INFO L89 Accepts]: Start accepts. Operand has 82 places, 37 transitions, 381 flow [2022-12-06 07:52:33,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:33,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:33,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 37 transitions, 381 flow [2022-12-06 07:52:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 37 transitions, 381 flow [2022-12-06 07:52:33,123 INFO L130 PetriNetUnfolder]: 50/212 cut-off events. [2022-12-06 07:52:33,123 INFO L131 PetriNetUnfolder]: For 666/684 co-relation queries the response was YES. [2022-12-06 07:52:33,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 212 events. 50/212 cut-off events. For 666/684 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1205 event pairs, 33 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 534. Up to 92 conditions per place. [2022-12-06 07:52:33,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 37 transitions, 381 flow [2022-12-06 07:52:33,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:52:35,410 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:35,411 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:35,411 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:35,411 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:35,495 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:52:35,496 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2385 [2022-12-06 07:52:35,496 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 407 flow [2022-12-06 07:52:35,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8666666666666667) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:35,496 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:35,496 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:35,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:35,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:52:35,701 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1302717854, now seen corresponding path program 1 times [2022-12-06 07:52:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:35,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939642778] [2022-12-06 07:52:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:36,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:36,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939642778] [2022-12-06 07:52:36,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939642778] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:36,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972064232] [2022-12-06 07:52:36,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:36,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:36,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:36,101 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:36,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:52:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:36,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 07:52:36,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:36,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:36,260 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 19 treesize of output 21 [2022-12-06 07:52:36,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:36,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:36,303 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_449) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)) 5)) is different from false [2022-12-06 07:52:36,314 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:36,316 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 44 treesize of output 41 [2022-12-06 07:52:36,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 07:52:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 07:52:36,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972064232] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:36,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:36,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-12-06 07:52:36,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834754041] [2022-12-06 07:52:36,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:36,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-06 07:52:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:36,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-06 07:52:36,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2022-12-06 07:52:36,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:52:36,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 407 flow. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:36,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:36,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:52:36,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:36,815 INFO L130 PetriNetUnfolder]: 493/932 cut-off events. [2022-12-06 07:52:36,815 INFO L131 PetriNetUnfolder]: For 5319/5319 co-relation queries the response was YES. [2022-12-06 07:52:36,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 932 events. 493/932 cut-off events. For 5319/5319 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4805 event pairs, 118 based on Foata normal form. 5/921 useless extension candidates. Maximal degree in co-relation 3979. Up to 371 conditions per place. [2022-12-06 07:52:36,821 INFO L137 encePairwiseOnDemand]: 5/18 looper letters, 58 selfloop transitions, 28 changer transitions 30/116 dead transitions. [2022-12-06 07:52:36,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 116 transitions, 1074 flow [2022-12-06 07:52:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 07:52:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 07:52:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-12-06 07:52:36,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2022-12-06 07:52:36,822 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 407 flow. Second operand 11 states and 100 transitions. [2022-12-06 07:52:36,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 116 transitions, 1074 flow [2022-12-06 07:52:36,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 116 transitions, 857 flow, removed 54 selfloop flow, removed 17 redundant places. [2022-12-06 07:52:36,828 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 520 flow [2022-12-06 07:52:36,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=520, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2022-12-06 07:52:36,829 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 39 predicate places. [2022-12-06 07:52:36,829 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:36,829 INFO L89 Accepts]: Start accepts. Operand has 58 places, 54 transitions, 520 flow [2022-12-06 07:52:36,830 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:36,830 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:36,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 54 transitions, 520 flow [2022-12-06 07:52:36,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 54 transitions, 520 flow [2022-12-06 07:52:36,858 INFO L130 PetriNetUnfolder]: 185/474 cut-off events. [2022-12-06 07:52:36,858 INFO L131 PetriNetUnfolder]: For 1310/1398 co-relation queries the response was YES. [2022-12-06 07:52:36,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1673 conditions, 474 events. 185/474 cut-off events. For 1310/1398 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2858 event pairs, 64 based on Foata normal form. 0/410 useless extension candidates. Maximal degree in co-relation 1355. Up to 297 conditions per place. [2022-12-06 07:52:36,861 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 54 transitions, 520 flow [2022-12-06 07:52:36,861 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-06 07:52:36,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [379] L81-4-->L82-1: Formula: (= (select (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t1~0#1.base_11|) |v_ULTIMATE.start_main_~#t1~0#1.offset_11|) |v_ULTIMATE.start_main_#t~mem14#1_10|) InVars {#memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_15|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 07:52:36,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 07:52:37,004 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:37,005 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:37,005 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:37,005 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:37,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 07:52:37,159 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:52:37,159 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 330 [2022-12-06 07:52:37,160 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 546 flow [2022-12-06 07:52:37,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:37,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:37,160 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:37,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:37,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 07:52:37,360 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1638014668, now seen corresponding path program 1 times [2022-12-06 07:52:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:37,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288913212] [2022-12-06 07:52:37,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288913212] [2022-12-06 07:52:37,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288913212] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:37,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005687174] [2022-12-06 07:52:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:37,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:37,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:37,828 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:37,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:52:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:37,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-06 07:52:37,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:37,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:52:37,990 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 19 treesize of output 21 [2022-12-06 07:52:38,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:38,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:38,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_486 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_486) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)))) is different from false [2022-12-06 07:52:38,064 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:52:38,064 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 44 treesize of output 41 [2022-12-06 07:52:38,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2022-12-06 07:52:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 07:52:38,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005687174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:38,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:38,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-06 07:52:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525898462] [2022-12-06 07:52:38,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:38,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 07:52:38,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 07:52:38,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=266, Unknown=1, NotChecked=32, Total=342 [2022-12-06 07:52:38,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 07:52:38,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 546 flow. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:38,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:38,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 07:52:38,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:38,767 INFO L130 PetriNetUnfolder]: 799/1498 cut-off events. [2022-12-06 07:52:38,767 INFO L131 PetriNetUnfolder]: For 5007/5007 co-relation queries the response was YES. [2022-12-06 07:52:38,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6605 conditions, 1498 events. 799/1498 cut-off events. For 5007/5007 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8745 event pairs, 64 based on Foata normal form. 21/1511 useless extension candidates. Maximal degree in co-relation 5942. Up to 799 conditions per place. [2022-12-06 07:52:38,773 INFO L137 encePairwiseOnDemand]: 5/21 looper letters, 59 selfloop transitions, 65 changer transitions 36/160 dead transitions. [2022-12-06 07:52:38,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 160 transitions, 1542 flow [2022-12-06 07:52:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:52:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:52:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 125 transitions. [2022-12-06 07:52:38,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42517006802721086 [2022-12-06 07:52:38,788 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 546 flow. Second operand 14 states and 125 transitions. [2022-12-06 07:52:38,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 160 transitions, 1542 flow [2022-12-06 07:52:38,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 160 transitions, 1413 flow, removed 52 selfloop flow, removed 6 redundant places. [2022-12-06 07:52:38,800 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 1034 flow [2022-12-06 07:52:38,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1034, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2022-12-06 07:52:38,801 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 53 predicate places. [2022-12-06 07:52:38,801 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:38,801 INFO L89 Accepts]: Start accepts. Operand has 72 places, 83 transitions, 1034 flow [2022-12-06 07:52:38,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:38,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:38,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 83 transitions, 1034 flow [2022-12-06 07:52:38,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 83 transitions, 1034 flow [2022-12-06 07:52:38,856 INFO L130 PetriNetUnfolder]: 314/788 cut-off events. [2022-12-06 07:52:38,856 INFO L131 PetriNetUnfolder]: For 4500/4686 co-relation queries the response was YES. [2022-12-06 07:52:38,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3528 conditions, 788 events. 314/788 cut-off events. For 4500/4686 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5374 event pairs, 106 based on Foata normal form. 11/717 useless extension candidates. Maximal degree in co-relation 3159. Up to 497 conditions per place. [2022-12-06 07:52:38,864 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 83 transitions, 1034 flow [2022-12-06 07:52:38,864 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 07:52:42,127 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:42,127 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:42,127 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:42,127 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:42,238 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:52:42,238 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3437 [2022-12-06 07:52:42,239 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 1056 flow [2022-12-06 07:52:42,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:42,239 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:42,239 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:42,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 07:52:42,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 07:52:42,443 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:42,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:42,443 INFO L85 PathProgramCache]: Analyzing trace with hash 446934420, now seen corresponding path program 1 times [2022-12-06 07:52:42,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:42,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859495845] [2022-12-06 07:52:42,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:42,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:42,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859495845] [2022-12-06 07:52:42,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859495845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771587843] [2022-12-06 07:52:42,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:42,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:42,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:42,526 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:42,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:52:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:42,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 07:52:42,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:42,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771587843] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:42,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 10 [2022-12-06 07:52:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510895506] [2022-12-06 07:52:42,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:42,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:52:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:52:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:52:42,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:52:42,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 1056 flow. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:42,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:42,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:52:42,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:42,979 INFO L130 PetriNetUnfolder]: 1519/2847 cut-off events. [2022-12-06 07:52:42,979 INFO L131 PetriNetUnfolder]: For 17074/17074 co-relation queries the response was YES. [2022-12-06 07:52:42,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14668 conditions, 2847 events. 1519/2847 cut-off events. For 17074/17074 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 19134 event pairs, 419 based on Foata normal form. 30/2870 useless extension candidates. Maximal degree in co-relation 13339. Up to 1554 conditions per place. [2022-12-06 07:52:43,014 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 73 selfloop transitions, 79 changer transitions 3/155 dead transitions. [2022-12-06 07:52:43,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 155 transitions, 2207 flow [2022-12-06 07:52:43,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:52:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:52:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-06 07:52:43,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48695652173913045 [2022-12-06 07:52:43,015 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 1056 flow. Second operand 5 states and 56 transitions. [2022-12-06 07:52:43,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 155 transitions, 2207 flow [2022-12-06 07:52:43,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 155 transitions, 2087 flow, removed 60 selfloop flow, removed 0 redundant places. [2022-12-06 07:52:43,049 INFO L231 Difference]: Finished difference. Result has 77 places, 126 transitions, 1811 flow [2022-12-06 07:52:43,049 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1811, PETRI_PLACES=77, PETRI_TRANSITIONS=126} [2022-12-06 07:52:43,050 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 58 predicate places. [2022-12-06 07:52:43,050 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:43,050 INFO L89 Accepts]: Start accepts. Operand has 77 places, 126 transitions, 1811 flow [2022-12-06 07:52:43,052 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:43,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:43,052 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 126 transitions, 1811 flow [2022-12-06 07:52:43,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 126 transitions, 1811 flow [2022-12-06 07:52:43,148 INFO L130 PetriNetUnfolder]: 600/1506 cut-off events. [2022-12-06 07:52:43,148 INFO L131 PetriNetUnfolder]: For 13146/13457 co-relation queries the response was YES. [2022-12-06 07:52:43,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 1506 events. 600/1506 cut-off events. For 13146/13457 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 11935 event pairs, 269 based on Foata normal form. 25/1414 useless extension candidates. Maximal degree in co-relation 7019. Up to 951 conditions per place. [2022-12-06 07:52:43,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 126 transitions, 1811 flow [2022-12-06 07:52:43,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 724 [2022-12-06 07:52:43,160 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:52:43,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 07:52:43,161 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 126 transitions, 1811 flow [2022-12-06 07:52:43,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:43,161 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:52:43,161 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:52:43,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 07:52:43,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:52:43,366 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:52:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:52:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash -783140148, now seen corresponding path program 1 times [2022-12-06 07:52:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:52:43,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725159142] [2022-12-06 07:52:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:52:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:43,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:52:43,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725159142] [2022-12-06 07:52:43,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725159142] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:52:43,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136514341] [2022-12-06 07:52:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:52:43,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:52:43,589 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:52:43,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:52:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:52:43,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 07:52:43,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:52:43,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:52:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:43,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:52:43,806 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-06 07:52:43,806 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 25 treesize of output 17 [2022-12-06 07:52:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:52:43,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136514341] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:52:43,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:52:43,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-06 07:52:43,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498695966] [2022-12-06 07:52:43,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:52:43,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 07:52:43,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:52:43,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 07:52:43,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-12-06 07:52:43,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 07:52:43,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 126 transitions, 1811 flow. Second operand has 16 states, 15 states have (on average 2.066666666666667) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:52:43,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:52:43,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 07:52:43,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:52:45,281 INFO L130 PetriNetUnfolder]: 2047/3935 cut-off events. [2022-12-06 07:52:45,281 INFO L131 PetriNetUnfolder]: For 28004/28004 co-relation queries the response was YES. [2022-12-06 07:52:45,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20784 conditions, 3935 events. 2047/3935 cut-off events. For 28004/28004 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 28401 event pairs, 345 based on Foata normal form. 119/4054 useless extension candidates. Maximal degree in co-relation 18821. Up to 2088 conditions per place. [2022-12-06 07:52:45,299 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 181 selfloop transitions, 96 changer transitions 167/444 dead transitions. [2022-12-06 07:52:45,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 444 transitions, 5100 flow [2022-12-06 07:52:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-06 07:52:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-06 07:52:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 353 transitions. [2022-12-06 07:52:45,309 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4011363636363636 [2022-12-06 07:52:45,309 INFO L175 Difference]: Start difference. First operand has 76 places, 126 transitions, 1811 flow. Second operand 40 states and 353 transitions. [2022-12-06 07:52:45,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 444 transitions, 5100 flow [2022-12-06 07:52:45,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 444 transitions, 4962 flow, removed 69 selfloop flow, removed 1 redundant places. [2022-12-06 07:52:45,358 INFO L231 Difference]: Finished difference. Result has 133 places, 179 transitions, 2992 flow [2022-12-06 07:52:45,358 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1741, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2992, PETRI_PLACES=133, PETRI_TRANSITIONS=179} [2022-12-06 07:52:45,359 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 114 predicate places. [2022-12-06 07:52:45,359 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:52:45,359 INFO L89 Accepts]: Start accepts. Operand has 133 places, 179 transitions, 2992 flow [2022-12-06 07:52:45,360 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:52:45,360 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:52:45,360 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 179 transitions, 2992 flow [2022-12-06 07:52:45,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 179 transitions, 2992 flow [2022-12-06 07:52:45,499 INFO L130 PetriNetUnfolder]: 698/1907 cut-off events. [2022-12-06 07:52:45,499 INFO L131 PetriNetUnfolder]: For 19870/20242 co-relation queries the response was YES. [2022-12-06 07:52:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 1907 events. 698/1907 cut-off events. For 19870/20242 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 16519 event pairs, 358 based on Foata normal form. 30/1788 useless extension candidates. Maximal degree in co-relation 9445. Up to 1159 conditions per place. [2022-12-06 07:52:45,514 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 179 transitions, 2992 flow [2022-12-06 07:52:45,515 INFO L188 LiptonReduction]: Number of co-enabled transitions 944 [2022-12-06 07:52:45,515 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:45,516 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:45,585 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 07:52:45,676 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:45,677 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:45,677 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:45,677 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:52:45,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 07:52:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:52:45,878 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~nondet1#1_124 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 07:52:45,881 INFO L158 Benchmark]: Toolchain (without parser) took 43230.26ms. Allocated memory was 182.5MB in the beginning and 296.7MB in the end (delta: 114.3MB). Free memory was 159.4MB in the beginning and 107.3MB in the end (delta: 52.1MB). Peak memory consumption was 168.3MB. Max. memory is 8.0GB. [2022-12-06 07:52:45,881 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:52:45,881 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.90ms. Allocated memory is still 182.5MB. Free memory was 159.4MB in the beginning and 146.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:52:45,881 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.75ms. Allocated memory is still 182.5MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:52:45,881 INFO L158 Benchmark]: Boogie Preprocessor took 35.89ms. Allocated memory is still 182.5MB. Free memory was 145.2MB in the beginning and 143.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:52:45,881 INFO L158 Benchmark]: RCFGBuilder took 454.44ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 123.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-06 07:52:45,881 INFO L158 Benchmark]: TraceAbstraction took 42465.99ms. Allocated memory was 182.5MB in the beginning and 296.7MB in the end (delta: 114.3MB). Free memory was 123.2MB in the beginning and 107.3MB in the end (delta: 15.9MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB. [2022-12-06 07:52:45,882 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.90ms. Allocated memory is still 182.5MB. Free memory was 159.4MB in the beginning and 146.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.75ms. Allocated memory is still 182.5MB. Free memory was 146.8MB in the beginning and 145.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.89ms. Allocated memory is still 182.5MB. Free memory was 145.2MB in the beginning and 143.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 454.44ms. Allocated memory is still 182.5MB. Free memory was 143.7MB in the beginning and 123.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 42465.99ms. Allocated memory was 182.5MB in the beginning and 296.7MB in the end (delta: 114.3MB). Free memory was 123.2MB in the beginning and 107.3MB in the end (delta: 15.9MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 98 PlacesBefore, 19 PlacesAfterwards, 100 TransitionsBefore, 15 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 191, independent conditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 18 PlacesBefore, 18 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 48 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: 3.7s, 32 PlacesBefore, 31 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 52 PlacesBefore, 52 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 8, Positive unconditional cache size: 4, 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: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 12, Positive conditional cache size: 8, Positive unconditional cache size: 4, 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: 2.1s, 60 PlacesBefore, 60 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2070, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 2065, unknown conditional: 2065, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 8, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 12, Positive conditional cache size: 8, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 90 PlacesBefore, 89 PlacesAfterwards, 92 TransitionsBefore, 91 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 30, independent unconditional: 10, 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: 40, independent: 40, independent conditional: 30, independent unconditional: 10, 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: 21, independent: 21, independent conditional: 16, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 19, independent conditional: 14, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 21, unknown conditional: 16, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 153, Positive conditional cache size: 83, Positive unconditional cache size: 70, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 638 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): 155, Positive cache size: 153, Positive conditional cache size: 83, Positive unconditional cache size: 70, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 494 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): 155, Positive cache size: 153, Positive conditional cache size: 83, Positive unconditional cache size: 70, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 93 PlacesBefore, 93 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 474 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): 155, Positive cache size: 153, Positive conditional cache size: 83, Positive unconditional cache size: 70, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 58 PlacesBefore, 58 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, 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): 175, Positive cache size: 173, Positive conditional cache size: 97, Positive unconditional cache size: 76, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 57 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 201, Positive conditional cache size: 113, Positive unconditional cache size: 88, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 72 PlacesBefore, 72 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 204, Positive conditional cache size: 113, Positive unconditional cache size: 91, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 724 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): 206, Positive cache size: 204, Positive conditional cache size: 113, Positive unconditional cache size: 91, Negative cache size: 2, Negative conditional cache size: 2, Negative unconditional cache size: 0, Unknown cache size: 1, Unknown conditional cache size: 1, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~nondet1#1_124 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~nondet1#1_124 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 07:52:45,913 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...