/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-a802222-m [2022-12-13 13:35:18,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:35:18,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:35:18,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:35:18,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:35:18,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:35:18,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:35:18,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:35:18,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:35:18,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:35:18,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:35:18,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:35:18,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:35:18,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:35:18,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:35:18,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:35:18,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:35:18,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:35:18,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:35:18,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:35:18,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:35:18,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:35:18,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:35:18,210 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:35:18,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:35:18,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:35:18,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:35:18,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:35:18,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:35:18,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:35:18,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:35:18,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:35:18,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:35:18,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:35:18,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:35:18,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:35:18,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:35:18,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:35:18,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:35:18,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:35:18,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:35:18,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 13:35:18,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:35:18,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:35:18,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:35:18,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:35:18,260 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:35:18,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:35:18,261 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:35:18,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:35:18,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:35:18,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:35:18,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:35:18,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:35:18,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:35:18,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 13:35:18,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:35:18,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:35:18,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:35:18,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:35:18,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:35:18,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:35:18,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:35:18,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 13:35:18,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 13:35:18,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:35:18,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:35:18,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:35:18,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:35:18,613 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:35:18,614 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-13 13:35:19,611 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:35:19,813 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:35:19,813 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-13 13:35:19,827 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f7fdb30/ff5a438e0f4f4073ae838a8bd943a78b/FLAGf3c3d67a0 [2022-12-13 13:35:19,843 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7f7fdb30/ff5a438e0f4f4073ae838a8bd943a78b [2022-12-13 13:35:19,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:35:19,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 13:35:19,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:35:19,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:35:19,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:35:19,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:35:19" (1/1) ... [2022-12-13 13:35:19,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4681648c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:19, skipping insertion in model container [2022-12-13 13:35:19,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:35:19" (1/1) ... [2022-12-13 13:35:19,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:35:19,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:35:20,021 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:35:20,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:35:20,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:35:20,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:35:20,041 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-13 13:35:20,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:35:20,057 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:35:20,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:35:20,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:35:20,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:35:20,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:35:20,074 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-13 13:35:20,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:35:20,089 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:35:20,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20 WrapperNode [2022-12-13 13:35:20,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:35:20,090 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:35:20,090 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:35:20,090 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:35:20,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,138 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 128 [2022-12-13 13:35:20,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:35:20,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:35:20,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:35:20,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:35:20,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:35:20,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:35:20,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:35:20,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:35:20,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (1/1) ... [2022-12-13 13:35:20,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:35:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:20,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:35:20,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:35:20,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 13:35:20,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 13:35:20,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:35:20,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:35:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:35:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:35:20,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:35:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:35:20,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:35:20,259 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 13:35:20,362 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 13:35:20,363 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:35:20,603 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 13:35:20,682 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:35:20,683 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 13:35:20,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:35:20 BoogieIcfgContainer [2022-12-13 13:35:20,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:35:20,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:35:20,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:35:20,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:35:20,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:35:19" (1/3) ... [2022-12-13 13:35:20,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2efc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:35:20, skipping insertion in model container [2022-12-13 13:35:20,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:35:20" (2/3) ... [2022-12-13 13:35:20,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2efc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:35:20, skipping insertion in model container [2022-12-13 13:35:20,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:35:20" (3/3) ... [2022-12-13 13:35:20,692 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2022-12-13 13:35:20,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:35:20,707 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 13:35:20,707 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:35:20,756 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 13:35:20,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 236 flow [2022-12-13 13:35:20,843 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2022-12-13 13:35:20,844 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:35:20,847 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-13 13:35:20,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 110 transitions, 236 flow [2022-12-13 13:35:20,851 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 100 transitions, 212 flow [2022-12-13 13:35:20,852 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:20,868 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-13 13:35:20,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 100 transitions, 212 flow [2022-12-13 13:35:20,920 INFO L130 PetriNetUnfolder]: 9/100 cut-off events. [2022-12-13 13:35:20,920 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:35:20,921 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-13 13:35:20,929 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-13 13:35:20,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-13 13:35:24,852 INFO L241 LiptonReduction]: Total number of compositions: 85 [2022-12-13 13:35:24,865 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:35:24,870 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;@677230ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 13:35:24,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 13:35:24,874 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-13 13:35:24,875 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:35:24,875 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:24,875 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:24,875 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-13 13:35:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:24,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1143381871, now seen corresponding path program 1 times [2022-12-13 13:35:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:24,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009517396] [2022-12-13 13:35:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:25,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:25,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009517396] [2022-12-13 13:35:25,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009517396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:25,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:25,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:35:25,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251585916] [2022-12-13 13:35:25,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:25,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:35:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:35:25,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:35:25,216 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:35:25,217 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-13 13:35:25,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:25,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:35:25,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:25,269 INFO L130 PetriNetUnfolder]: 38/71 cut-off events. [2022-12-13 13:35:25,269 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 13:35:25,269 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-13 13:35:25,271 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2022-12-13 13:35:25,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 110 flow [2022-12-13 13:35:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:35:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:35:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-13 13:35:25,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-13 13:35:25,282 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 24 transitions. [2022-12-13 13:35:25,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 110 flow [2022-12-13 13:35:25,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:25,287 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 46 flow [2022-12-13 13:35:25,289 INFO L277 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-13 13:35:25,293 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-13 13:35:25,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:25,294 INFO L89 Accepts]: Start accepts. Operand has 18 places, 16 transitions, 46 flow [2022-12-13 13:35:25,297 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:25,297 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:25,297 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 16 transitions, 46 flow [2022-12-13 13:35:25,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 16 transitions, 46 flow [2022-12-13 13:35:25,308 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-13 13:35:25,309 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:35:25,309 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-13 13:35:25,311 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 16 transitions, 46 flow [2022-12-13 13:35:25,311 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 13:35:25,311 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:25,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-13 13:35:25,314 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 46 flow [2022-12-13 13:35:25,314 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-13 13:35:25,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:25,315 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:25,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:35:25,318 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-13 13:35:25,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:25,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1742405358, now seen corresponding path program 1 times [2022-12-13 13:35:25,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:25,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896283861] [2022-12-13 13:35:25,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:35:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:25,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896283861] [2022-12-13 13:35:25,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896283861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:25,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:25,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:35:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070202689] [2022-12-13 13:35:25,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:25,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:35:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:25,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:35:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:35:25,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:35:25,491 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-13 13:35:25,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:25,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:35:25,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:25,537 INFO L130 PetriNetUnfolder]: 52/102 cut-off events. [2022-12-13 13:35:25,537 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 13:35:25,537 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-13 13:35:25,538 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 18 selfloop transitions, 2 changer transitions 5/25 dead transitions. [2022-12-13 13:35:25,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 25 transitions, 117 flow [2022-12-13 13:35:25,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:35:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:35:25,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-13 13:35:25,539 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 13:35:25,539 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 46 flow. Second operand 3 states and 25 transitions. [2022-12-13 13:35:25,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 25 transitions, 117 flow [2022-12-13 13:35:25,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:25,541 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 56 flow [2022-12-13 13:35:25,541 INFO L277 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-13 13:35:25,541 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 1 predicate places. [2022-12-13 13:35:25,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:25,542 INFO L89 Accepts]: Start accepts. Operand has 20 places, 17 transitions, 56 flow [2022-12-13 13:35:25,542 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:25,542 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:25,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 17 transitions, 56 flow [2022-12-13 13:35:25,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 56 flow [2022-12-13 13:35:25,546 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 13:35:25,546 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 13:35:25,547 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-13 13:35:25,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 17 transitions, 56 flow [2022-12-13 13:35:25,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 13:35:25,548 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:25,548 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 13:35:25,548 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 56 flow [2022-12-13 13:35:25,549 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-13 13:35:25,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:25,549 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:25,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:35:25,549 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-13 13:35:25,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:25,550 INFO L85 PathProgramCache]: Analyzing trace with hash 253712065, now seen corresponding path program 1 times [2022-12-13 13:35:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:25,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238248197] [2022-12-13 13:35:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:25,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:25,643 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-13 13:35:25,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:25,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238248197] [2022-12-13 13:35:25,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238248197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:25,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:35:25,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:35:25,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848706298] [2022-12-13 13:35:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:25,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:35:25,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:25,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:35:25,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:35:25,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:35:25,646 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-13 13:35:25,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:25,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:35:25,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:25,701 INFO L130 PetriNetUnfolder]: 61/130 cut-off events. [2022-12-13 13:35:25,702 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-13 13:35:25,702 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-13 13:35:25,703 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 10/28 dead transitions. [2022-12-13 13:35:25,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 138 flow [2022-12-13 13:35:25,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:35:25,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:35:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-13 13:35:25,704 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 13:35:25,704 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 56 flow. Second operand 4 states and 27 transitions. [2022-12-13 13:35:25,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 138 flow [2022-12-13 13:35:25,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 28 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:25,706 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 68 flow [2022-12-13 13:35:25,706 INFO L277 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-13 13:35:25,706 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-13 13:35:25,706 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:25,707 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 68 flow [2022-12-13 13:35:25,708 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:25,708 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:25,708 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 68 flow [2022-12-13 13:35:25,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 68 flow [2022-12-13 13:35:25,713 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-13 13:35:25,713 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 13:35:25,715 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-13 13:35:25,716 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 68 flow [2022-12-13 13:35:25,717 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 13:35:26,552 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:35:26,553 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 847 [2022-12-13 13:35:26,553 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 64 flow [2022-12-13 13:35:26,553 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-13 13:35:26,554 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:26,554 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:26,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:35:26,554 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-13 13:35:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1524411168, now seen corresponding path program 1 times [2022-12-13 13:35:26,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:26,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053249992] [2022-12-13 13:35:26,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:26,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:26,958 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-13 13:35:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:26,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053249992] [2022-12-13 13:35:26,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053249992] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:26,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484056752] [2022-12-13 13:35:26,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:26,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:26,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:26,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:26,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:35:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:27,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 13:35:27,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:27,132 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-13 13:35:27,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:35:27,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:35:27,306 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-13 13:35:27,314 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-13 13:35:27,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:27,530 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-13 13:35:27,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484056752] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:27,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:27,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 12 [2022-12-13 13:35:27,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079877826] [2022-12-13 13:35:27,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:27,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 13:35:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 13:35:27,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=134, Unknown=1, NotChecked=0, Total=182 [2022-12-13 13:35:27,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-13 13:35:27,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 64 flow. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-13 13:35:27,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:27,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-13 13:35:27,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:29,819 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-13 13:35:31,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 13:35:32,145 INFO L130 PetriNetUnfolder]: 176/343 cut-off events. [2022-12-13 13:35:32,145 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-13 13:35:32,146 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-13 13:35:32,147 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 47 selfloop transitions, 20 changer transitions 16/83 dead transitions. [2022-12-13 13:35:32,147 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 83 transitions, 429 flow [2022-12-13 13:35:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:35:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:35:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-12-13 13:35:32,148 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-13 13:35:32,149 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 64 flow. Second operand 11 states and 81 transitions. [2022-12-13 13:35:32,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 83 transitions, 429 flow [2022-12-13 13:35:32,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 83 transitions, 405 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 13:35:32,151 INFO L231 Difference]: Finished difference. Result has 32 places, 36 transitions, 195 flow [2022-12-13 13:35:32,151 INFO L277 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-13 13:35:32,152 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 13 predicate places. [2022-12-13 13:35:32,152 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:32,152 INFO L89 Accepts]: Start accepts. Operand has 32 places, 36 transitions, 195 flow [2022-12-13 13:35:32,153 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:32,153 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:32,153 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 36 transitions, 195 flow [2022-12-13 13:35:32,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 36 transitions, 195 flow [2022-12-13 13:35:32,162 INFO L130 PetriNetUnfolder]: 17/94 cut-off events. [2022-12-13 13:35:32,162 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 13:35:32,163 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 426 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-13 13:35:32,163 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 36 transitions, 195 flow [2022-12-13 13:35:32,163 INFO L226 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-13 13:35:34,356 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,356 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,356 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:34,357 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:36,527 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:35:36,528 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4376 [2022-12-13 13:35:36,529 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 204 flow [2022-12-13 13:35:36,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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-13 13:35:36,529 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:36,529 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:36,533 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-13 13:35:36,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:36,732 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-13 13:35:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1052488678, now seen corresponding path program 1 times [2022-12-13 13:35:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:36,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521433000] [2022-12-13 13:35:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:37,149 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-13 13:35:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:37,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521433000] [2022-12-13 13:35:37,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521433000] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:37,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031063381] [2022-12-13 13:35:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:37,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:37,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:37,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:37,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:35:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:37,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 13:35:37,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:37,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-13 13:35:37,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 13:35:37,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:37,426 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-13 13:35:37,465 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-13 13:35:37,472 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-13 13:35:37,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:37,500 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-13 13:35:37,548 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-13 13:35:37,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031063381] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:37,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:37,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:35:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991796080] [2022-12-13 13:35:37,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:37,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:35:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:35:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=1, NotChecked=18, Total=132 [2022-12-13 13:35:37,550 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-13 13:35:37,550 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-13 13:35:37,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:37,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-13 13:35:37,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:37,806 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (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)))) (and .cse0 (= 5 c_~x~0) (or (not (= 5 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) .cse0 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))))) is different from false [2022-12-13 13:35:39,810 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-13 13:35:40,167 INFO L130 PetriNetUnfolder]: 355/669 cut-off events. [2022-12-13 13:35:40,167 INFO L131 PetriNetUnfolder]: For 784/784 co-relation queries the response was YES. [2022-12-13 13:35:40,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1989 conditions, 669 events. 355/669 cut-off events. For 784/784 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3214 event pairs, 67 based on Foata normal form. 3/668 useless extension candidates. Maximal degree in co-relation 781. Up to 212 conditions per place. [2022-12-13 13:35:40,170 INFO L137 encePairwiseOnDemand]: 3/19 looper letters, 71 selfloop transitions, 46 changer transitions 24/141 dead transitions. [2022-12-13 13:35:40,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 141 transitions, 867 flow [2022-12-13 13:35:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:35:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:35:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2022-12-13 13:35:40,173 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39473684210526316 [2022-12-13 13:35:40,173 INFO L175 Difference]: Start difference. First operand has 31 places, 35 transitions, 204 flow. Second operand 18 states and 135 transitions. [2022-12-13 13:35:40,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 141 transitions, 867 flow [2022-12-13 13:35:40,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 141 transitions, 850 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:40,178 INFO L231 Difference]: Finished difference. Result has 57 places, 65 transitions, 558 flow [2022-12-13 13:35:40,178 INFO L277 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=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=558, PETRI_PLACES=57, PETRI_TRANSITIONS=65} [2022-12-13 13:35:40,179 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 38 predicate places. [2022-12-13 13:35:40,179 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:40,179 INFO L89 Accepts]: Start accepts. Operand has 57 places, 65 transitions, 558 flow [2022-12-13 13:35:40,180 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:40,180 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:40,180 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 65 transitions, 558 flow [2022-12-13 13:35:40,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 65 transitions, 558 flow [2022-12-13 13:35:40,217 INFO L130 PetriNetUnfolder]: 203/482 cut-off events. [2022-12-13 13:35:40,217 INFO L131 PetriNetUnfolder]: For 1399/1463 co-relation queries the response was YES. [2022-12-13 13:35:40,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 482 events. 203/482 cut-off events. For 1399/1463 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2806 event pairs, 98 based on Foata normal form. 4/433 useless extension candidates. Maximal degree in co-relation 1649. Up to 295 conditions per place. [2022-12-13 13:35:40,222 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 65 transitions, 558 flow [2022-12-13 13:35:40,222 INFO L226 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-13 13:35:40,223 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-13 13:35:40,298 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-13 13:35:40,398 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-13 13:35:40,455 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [446] L52-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_Out_2| 0) (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_In_1| 256) 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_Out_2| 0)) InVars {thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_In_1|} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_Out_2|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_Out_2|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_#t~nondet1#1, thread1Thread1of1ForFork0_#res#1.base] 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-13 13:35:40,524 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] L52-->L82-1: Formula: (and (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_48| 256) 0)) (= |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)) (= (ite (= 5 (select (select |v_#memory_int_149| v_~queue~0.base_90) (+ (* v_~back~0_111 4) v_~queue~0.offset_90))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_19|) (= (select (select |v_#memory_int_149| |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_50|) (not (= (ite (and (<= 0 v_~back~0_111) (< v_~back~0_111 v_~n~0_84)) 1 0) 0)) (= v_~back~0_110 (+ v_~back~0_111 1))) InVars {~queue~0.offset=v_~queue~0.offset_90, #memory_int=|v_#memory_int_149|, ~back~0=v_~back~0_111, 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_84, 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_110, 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_59|, 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_50|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_19|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_45|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_19|, ~n~0=v_~n~0_84} 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-13 13:35:40,644 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 13:35:40,663 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 484 [2022-12-13 13:35:40,663 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 64 transitions, 583 flow [2022-12-13 13:35:40,664 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-13 13:35:40,664 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:40,664 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:40,670 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-13 13:35:40,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:40,870 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-13 13:35:40,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1709251336, now seen corresponding path program 1 times [2022-12-13 13:35:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:40,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250880686] [2022-12-13 13:35:40,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:40,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:41,241 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-13 13:35:41,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250880686] [2022-12-13 13:35:41,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250880686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:41,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485813624] [2022-12-13 13:35:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:41,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:41,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:41,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:35:41,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:35:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:41,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-13 13:35:41,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:41,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:41,366 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-13 13:35:41,389 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-13 13:35:41,393 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-13 13:35:41,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:41,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:41,441 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-13 13:35:41,452 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-13 13:35:41,468 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-13 13:35:41,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485813624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:41,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:41,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-13 13:35:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485446076] [2022-12-13 13:35:41,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:41,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:35:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:41,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:35:41,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=80, Unknown=3, NotChecked=0, Total=110 [2022-12-13 13:35:41,470 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 13:35:41,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 64 transitions, 583 flow. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:41,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:41,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 13:35:41,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:41,745 INFO L130 PetriNetUnfolder]: 385/755 cut-off events. [2022-12-13 13:35:41,745 INFO L131 PetriNetUnfolder]: For 3687/3687 co-relation queries the response was YES. [2022-12-13 13:35:41,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 755 events. 385/755 cut-off events. For 3687/3687 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3989 event pairs, 104 based on Foata normal form. 7/760 useless extension candidates. Maximal degree in co-relation 3164. Up to 397 conditions per place. [2022-12-13 13:35:41,750 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 56 selfloop transitions, 31 changer transitions 9/96 dead transitions. [2022-12-13 13:35:41,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 1029 flow [2022-12-13 13:35:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-12-13 13:35:41,751 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-13 13:35:41,752 INFO L175 Difference]: Start difference. First operand has 55 places, 64 transitions, 583 flow. Second operand 5 states and 51 transitions. [2022-12-13 13:35:41,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 1029 flow [2022-12-13 13:35:41,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 950 flow, removed 37 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:41,766 INFO L231 Difference]: Finished difference. Result has 60 places, 70 transitions, 673 flow [2022-12-13 13:35:41,766 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=60, PETRI_TRANSITIONS=70} [2022-12-13 13:35:41,767 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 41 predicate places. [2022-12-13 13:35:41,767 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:41,767 INFO L89 Accepts]: Start accepts. Operand has 60 places, 70 transitions, 673 flow [2022-12-13 13:35:41,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:41,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:41,768 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 70 transitions, 673 flow [2022-12-13 13:35:41,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 70 transitions, 673 flow [2022-12-13 13:35:41,812 INFO L130 PetriNetUnfolder]: 218/546 cut-off events. [2022-12-13 13:35:41,812 INFO L131 PetriNetUnfolder]: For 1799/1877 co-relation queries the response was YES. [2022-12-13 13:35:41,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 546 events. 218/546 cut-off events. For 1799/1877 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3460 event pairs, 112 based on Foata normal form. 3/499 useless extension candidates. Maximal degree in co-relation 1902. Up to 333 conditions per place. [2022-12-13 13:35:41,817 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 70 transitions, 673 flow [2022-12-13 13:35:41,817 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 13:35:41,817 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:41,818 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 13:35:41,818 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 70 transitions, 673 flow [2022-12-13 13:35:41,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:41,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:41,819 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:41,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 13:35:42,023 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-13 13:35:42,024 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-13 13:35:42,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:42,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1238465038, now seen corresponding path program 1 times [2022-12-13 13:35:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:42,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829375610] [2022-12-13 13:35:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:42,110 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-13 13:35:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:42,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829375610] [2022-12-13 13:35:42,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829375610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:42,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507352858] [2022-12-13 13:35:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:42,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:42,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:42,112 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-13 13:35:42,142 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-13 13:35:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:42,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 13:35:42,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:42,261 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-13 13:35:42,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:42,323 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-13 13:35:42,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507352858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:42,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:42,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-13 13:35:42,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994979554] [2022-12-13 13:35:42,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:42,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:35:42,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:42,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:35:42,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:35:42,325 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-13 13:35:42,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 70 transitions, 673 flow. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 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-13 13:35:42,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:42,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-13 13:35:42,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:42,587 INFO L130 PetriNetUnfolder]: 439/915 cut-off events. [2022-12-13 13:35:42,588 INFO L131 PetriNetUnfolder]: For 5370/5370 co-relation queries the response was YES. [2022-12-13 13:35:42,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5022 conditions, 915 events. 439/915 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5391 event pairs, 137 based on Foata normal form. 64/975 useless extension candidates. Maximal degree in co-relation 2743. Up to 515 conditions per place. [2022-12-13 13:35:42,593 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 47 selfloop transitions, 13 changer transitions 51/111 dead transitions. [2022-12-13 13:35:42,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 1221 flow [2022-12-13 13:35:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:35:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:35:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-13 13:35:42,594 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2022-12-13 13:35:42,594 INFO L175 Difference]: Start difference. First operand has 60 places, 70 transitions, 673 flow. Second operand 7 states and 71 transitions. [2022-12-13 13:35:42,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 1221 flow [2022-12-13 13:35:42,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 111 transitions, 1201 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 13:35:42,603 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 485 flow [2022-12-13 13:35:42,603 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2022-12-13 13:35:42,604 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 45 predicate places. [2022-12-13 13:35:42,604 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:42,604 INFO L89 Accepts]: Start accepts. Operand has 64 places, 41 transitions, 485 flow [2022-12-13 13:35:42,605 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:42,605 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:42,605 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 41 transitions, 485 flow [2022-12-13 13:35:42,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 485 flow [2022-12-13 13:35:42,635 INFO L130 PetriNetUnfolder]: 119/341 cut-off events. [2022-12-13 13:35:42,635 INFO L131 PetriNetUnfolder]: For 1010/1112 co-relation queries the response was YES. [2022-12-13 13:35:42,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 341 events. 119/341 cut-off events. For 1010/1112 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2083 event pairs, 91 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 643. Up to 228 conditions per place. [2022-12-13 13:35:42,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 485 flow [2022-12-13 13:35:42,639 INFO L226 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-13 13:35:42,650 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:42,651 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 13:35:42,651 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 485 flow [2022-12-13 13:35:42,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 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-13 13:35:42,652 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:42,652 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:42,659 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-13 13:35:42,856 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-13 13:35:42,857 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-13 13:35:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:42,857 INFO L85 PathProgramCache]: Analyzing trace with hash 736487216, now seen corresponding path program 1 times [2022-12-13 13:35:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:42,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484634451] [2022-12-13 13:35:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:42,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:43,263 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-13 13:35:43,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:43,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484634451] [2022-12-13 13:35:43,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484634451] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:43,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182594118] [2022-12-13 13:35:43,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:43,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:43,268 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-13 13:35:43,283 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-13 13:35:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:43,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 13:35:43,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:43,377 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-13 13:35:43,386 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-13 13:35:43,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:43,407 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 13:35:43,408 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 24 treesize of output 15 [2022-12-13 13:35:43,422 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-13 13:35:43,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182594118] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:43,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:43,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 13:35:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615315911] [2022-12-13 13:35:43,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:43,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:35:43,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:43,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:35:43,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:35:43,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:35:43,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 485 flow. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:43,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:35:43,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:43,733 INFO L130 PetriNetUnfolder]: 416/820 cut-off events. [2022-12-13 13:35:43,734 INFO L131 PetriNetUnfolder]: For 5425/5425 co-relation queries the response was YES. [2022-12-13 13:35:43,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 820 events. 416/820 cut-off events. For 5425/5425 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4440 event pairs, 93 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 1991. Up to 463 conditions per place. [2022-12-13 13:35:43,739 INFO L137 encePairwiseOnDemand]: 8/17 looper letters, 49 selfloop transitions, 28 changer transitions 16/93 dead transitions. [2022-12-13 13:35:43,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 1133 flow [2022-12-13 13:35:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:35:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:35:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-12-13 13:35:43,741 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2022-12-13 13:35:43,741 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 485 flow. Second operand 8 states and 66 transitions. [2022-12-13 13:35:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 1133 flow [2022-12-13 13:35:43,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 93 transitions, 903 flow, removed 108 selfloop flow, removed 9 redundant places. [2022-12-13 13:35:43,752 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 619 flow [2022-12-13 13:35:43,753 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2022-12-13 13:35:43,755 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 34 predicate places. [2022-12-13 13:35:43,755 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:43,755 INFO L89 Accepts]: Start accepts. Operand has 53 places, 50 transitions, 619 flow [2022-12-13 13:35:43,756 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:43,756 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:43,757 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 50 transitions, 619 flow [2022-12-13 13:35:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 50 transitions, 619 flow [2022-12-13 13:35:43,789 INFO L130 PetriNetUnfolder]: 176/491 cut-off events. [2022-12-13 13:35:43,790 INFO L131 PetriNetUnfolder]: For 1095/1112 co-relation queries the response was YES. [2022-12-13 13:35:43,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 491 events. 176/491 cut-off events. For 1095/1112 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3359 event pairs, 136 based on Foata normal form. 7/427 useless extension candidates. Maximal degree in co-relation 939. Up to 331 conditions per place. [2022-12-13 13:35:43,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 50 transitions, 619 flow [2022-12-13 13:35:43,793 INFO L226 LiptonReduction]: Number of co-enabled transitions 220 [2022-12-13 13:35:43,798 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:43,799 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 13:35:43,799 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 619 flow [2022-12-13 13:35:43,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:43,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:43,800 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:43,811 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-13 13:35:44,004 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-13 13:35:44,005 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-13 13:35:44,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:44,005 INFO L85 PathProgramCache]: Analyzing trace with hash 406379500, now seen corresponding path program 2 times [2022-12-13 13:35:44,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:44,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463451217] [2022-12-13 13:35:44,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:44,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:44,431 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-13 13:35:44,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:44,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463451217] [2022-12-13 13:35:44,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463451217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:44,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094441814] [2022-12-13 13:35:44,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:35:44,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:44,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:44,436 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-13 13:35:44,446 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-13 13:35:44,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:35:44,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:35:44,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 13:35:44,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:44,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:44,591 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-13 13:35:44,604 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-13 13:35:44,608 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-13 13:35:44,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:44,659 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:44,660 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 29 treesize of output 25 [2022-12-13 13:35:44,700 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-13 13:35:44,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094441814] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:44,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:44,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 13:35:44,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798854718] [2022-12-13 13:35:44,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:44,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 13:35:44,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:44,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 13:35:44,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-13 13:35:44,701 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:35:44,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 619 flow. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:44,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:44,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:35:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:44,959 INFO L130 PetriNetUnfolder]: 458/901 cut-off events. [2022-12-13 13:35:44,959 INFO L131 PetriNetUnfolder]: For 4027/4027 co-relation queries the response was YES. [2022-12-13 13:35:44,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4073 conditions, 901 events. 458/901 cut-off events. For 4027/4027 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4950 event pairs, 131 based on Foata normal form. 3/904 useless extension candidates. Maximal degree in co-relation 2767. Up to 511 conditions per place. [2022-12-13 13:35:44,964 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 43 selfloop transitions, 28 changer transitions 14/85 dead transitions. [2022-12-13 13:35:44,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 85 transitions, 976 flow [2022-12-13 13:35:44,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:35:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:35:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-13 13:35:44,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2022-12-13 13:35:44,966 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 619 flow. Second operand 6 states and 55 transitions. [2022-12-13 13:35:44,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 85 transitions, 976 flow [2022-12-13 13:35:44,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 956 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 13:35:44,973 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 714 flow [2022-12-13 13:35:44,973 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2022-12-13 13:35:44,974 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 38 predicate places. [2022-12-13 13:35:44,974 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:44,974 INFO L89 Accepts]: Start accepts. Operand has 57 places, 52 transitions, 714 flow [2022-12-13 13:35:44,977 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:44,977 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:44,977 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 52 transitions, 714 flow [2022-12-13 13:35:44,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 52 transitions, 714 flow [2022-12-13 13:35:45,010 INFO L130 PetriNetUnfolder]: 194/536 cut-off events. [2022-12-13 13:35:45,011 INFO L131 PetriNetUnfolder]: For 1447/1461 co-relation queries the response was YES. [2022-12-13 13:35:45,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1634 conditions, 536 events. 194/536 cut-off events. For 1447/1461 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3693 event pairs, 151 based on Foata normal form. 5/456 useless extension candidates. Maximal degree in co-relation 1090. Up to 364 conditions per place. [2022-12-13 13:35:45,014 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 52 transitions, 714 flow [2022-12-13 13:35:45,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-13 13:35:45,015 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:45,016 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 13:35:45,016 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 714 flow [2022-12-13 13:35:45,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:45,016 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:45,016 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:45,026 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-13 13:35:45,222 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-13 13:35:45,222 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-13 13:35:45,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash 884035485, now seen corresponding path program 1 times [2022-12-13 13:35:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:45,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171329539] [2022-12-13 13:35:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:45,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:45,728 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-13 13:35:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171329539] [2022-12-13 13:35:45,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171329539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438624840] [2022-12-13 13:35:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:45,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:45,731 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-13 13:35:45,733 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-13 13:35:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:45,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 13:35:45,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:45,923 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-13 13:35:45,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 13:35:45,990 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:45,991 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 17 treesize of output 10 [2022-12-13 13:35:45,996 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-13 13:35:45,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:46,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_292 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)))) is different from false [2022-12-13 13:35:46,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:46,060 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-13 13:35:46,064 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-13 13:35:46,131 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-13 13:35:46,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438624840] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:46,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:46,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-12-13 13:35:46,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435666467] [2022-12-13 13:35:46,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:46,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:35:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:46,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:35:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2022-12-13 13:35:46,133 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:35:46,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 714 flow. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 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-13 13:35:46,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:46,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:35:46,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:47,298 INFO L130 PetriNetUnfolder]: 774/1479 cut-off events. [2022-12-13 13:35:47,298 INFO L131 PetriNetUnfolder]: For 8861/8861 co-relation queries the response was YES. [2022-12-13 13:35:47,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7005 conditions, 1479 events. 774/1479 cut-off events. For 8861/8861 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8517 event pairs, 165 based on Foata normal form. 24/1503 useless extension candidates. Maximal degree in co-relation 5273. Up to 835 conditions per place. [2022-12-13 13:35:47,306 INFO L137 encePairwiseOnDemand]: 5/17 looper letters, 107 selfloop transitions, 63 changer transitions 25/195 dead transitions. [2022-12-13 13:35:47,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 195 transitions, 2163 flow [2022-12-13 13:35:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:35:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:35:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 161 transitions. [2022-12-13 13:35:47,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4984520123839009 [2022-12-13 13:35:47,309 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 714 flow. Second operand 19 states and 161 transitions. [2022-12-13 13:35:47,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 195 transitions, 2163 flow [2022-12-13 13:35:47,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 195 transitions, 2092 flow, removed 15 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:47,322 INFO L231 Difference]: Finished difference. Result has 81 places, 97 transitions, 1484 flow [2022-12-13 13:35:47,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1484, PETRI_PLACES=81, PETRI_TRANSITIONS=97} [2022-12-13 13:35:47,323 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 62 predicate places. [2022-12-13 13:35:47,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:47,323 INFO L89 Accepts]: Start accepts. Operand has 81 places, 97 transitions, 1484 flow [2022-12-13 13:35:47,326 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:47,326 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:47,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 97 transitions, 1484 flow [2022-12-13 13:35:47,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 97 transitions, 1484 flow [2022-12-13 13:35:47,401 INFO L130 PetriNetUnfolder]: 425/1000 cut-off events. [2022-12-13 13:35:47,401 INFO L131 PetriNetUnfolder]: For 4960/5246 co-relation queries the response was YES. [2022-12-13 13:35:47,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4642 conditions, 1000 events. 425/1000 cut-off events. For 4960/5246 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6890 event pairs, 240 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 4228. Up to 625 conditions per place. [2022-12-13 13:35:47,416 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 97 transitions, 1484 flow [2022-12-13 13:35:47,416 INFO L226 LiptonReduction]: Number of co-enabled transitions 394 [2022-12-13 13:35:48,604 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-13 13:35:48,686 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:48,686 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:48,774 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:48,774 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:48,774 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:48,774 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:48,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L52-->L52: Formula: (let ((.cse1 (select |v_#memory_int_206| v_~queue~0.base_119)) (.cse2 (* v_~back~0_160 4))) (and (not (= 0 (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_94| 256))) (not (= (ite (let ((.cse0 (+ v_~back~0_160 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_106))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|) (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_119 4))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_93| 256) 0)) (not (= (ite (and (< v_~back~0_160 v_~n~0_106) (<= 0 v_~back~0_160)) 1 0) 0)) (= v_~back~0_158 (+ v_~back~0_160 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| 0)) (not (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_119))) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_119, ~back~0=v_~back~0_160, #memory_int=|v_#memory_int_206|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_94|, ~queue~0.base=v_~queue~0.base_119, ~n~0=v_~n~0_106} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|, ~queue~0.offset=v_~queue~0.offset_119, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_48|, ~back~0=v_~back~0_158, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48|, #memory_int=|v_#memory_int_206|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_48|, ~queue~0.base=v_~queue~0.base_119, ~n~0=v_~n~0_106} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_93|] 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-13 13:35:49,111 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L52-->L52: Formula: (let ((.cse1 (select |v_#memory_int_206| v_~queue~0.base_119)) (.cse2 (* v_~back~0_160 4))) (and (not (= 0 (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_94| 256))) (not (= (ite (let ((.cse0 (+ v_~back~0_160 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_106))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|) (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_119 4))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_93| 256) 0)) (not (= (ite (and (< v_~back~0_160 v_~n~0_106) (<= 0 v_~back~0_160)) 1 0) 0)) (= v_~back~0_158 (+ v_~back~0_160 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| 0)) (not (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_119))) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_119, ~back~0=v_~back~0_160, #memory_int=|v_#memory_int_206|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_94|, ~queue~0.base=v_~queue~0.base_119, ~n~0=v_~n~0_106} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|, ~queue~0.offset=v_~queue~0.offset_119, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_48|, ~back~0=v_~back~0_158, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48|, #memory_int=|v_#memory_int_206|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_48|, ~queue~0.base=v_~queue~0.base_119, ~n~0=v_~n~0_106} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_93|] 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 [444] L64-->thread2EXIT: Formula: (and (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_In_1| 256) 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_2| 0) (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_2| 0)) InVars {thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_2|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_2|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~nondet4#1] [2022-12-13 13:35:49,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L52-->L52: Formula: (let ((.cse1 (select |v_#memory_int_206| v_~queue~0.base_119)) (.cse2 (* v_~back~0_160 4))) (and (not (= 0 (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_94| 256))) (not (= (ite (let ((.cse0 (+ v_~back~0_160 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_106))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|) (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_119 4))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_93| 256) 0)) (not (= (ite (and (< v_~back~0_160 v_~n~0_106) (<= 0 v_~back~0_160)) 1 0) 0)) (= v_~back~0_158 (+ v_~back~0_160 2)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48| 0)) (not (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_119))) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_119, ~back~0=v_~back~0_160, #memory_int=|v_#memory_int_206|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_94|, ~queue~0.base=v_~queue~0.base_119, ~n~0=v_~n~0_106} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_48|, ~queue~0.offset=v_~queue~0.offset_119, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_48|, ~back~0=v_~back~0_158, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_48|, #memory_int=|v_#memory_int_206|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_48|, ~queue~0.base=v_~queue~0.base_119, ~n~0=v_~n~0_106} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_93|] 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-13 13:35:49,529 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:49,529 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:49,529 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:49,529 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:49,739 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:35:49,740 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2417 [2022-12-13 13:35:49,740 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 96 transitions, 1528 flow [2022-12-13 13:35:49,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 16 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-13 13:35:49,740 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:49,740 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:49,747 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-13 13:35:49,947 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-13 13:35:49,947 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-13 13:35:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:49,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1633092976, now seen corresponding path program 2 times [2022-12-13 13:35:49,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:49,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921963332] [2022-12-13 13:35:49,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:49,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:50,045 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-13 13:35:50,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:50,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921963332] [2022-12-13 13:35:50,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921963332] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:50,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919690246] [2022-12-13 13:35:50,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:35:50,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:50,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:50,047 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-13 13:35:50,050 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-13 13:35:50,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:35:50,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:35:50,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:35:50,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:50,161 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-13 13:35:50,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:50,231 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-13 13:35:50,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919690246] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:50,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:50,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2022-12-13 13:35:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757767383] [2022-12-13 13:35:50,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:50,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:35:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:35:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:35:50,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:35:50,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 96 transitions, 1528 flow. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:50,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:50,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:35:50,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:50,627 INFO L130 PetriNetUnfolder]: 1355/2584 cut-off events. [2022-12-13 13:35:50,627 INFO L131 PetriNetUnfolder]: For 27357/27357 co-relation queries the response was YES. [2022-12-13 13:35:50,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15990 conditions, 2584 events. 1355/2584 cut-off events. For 27357/27357 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 17012 event pairs, 294 based on Foata normal form. 30/2614 useless extension candidates. Maximal degree in co-relation 14064. Up to 1448 conditions per place. [2022-12-13 13:35:50,646 INFO L137 encePairwiseOnDemand]: 13/25 looper letters, 104 selfloop transitions, 84 changer transitions 8/196 dead transitions. [2022-12-13 13:35:50,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 196 transitions, 3340 flow [2022-12-13 13:35:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-12-13 13:35:50,647 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.528 [2022-12-13 13:35:50,647 INFO L175 Difference]: Start difference. First operand has 80 places, 96 transitions, 1528 flow. Second operand 5 states and 66 transitions. [2022-12-13 13:35:50,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 196 transitions, 3340 flow [2022-12-13 13:35:50,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 196 transitions, 2842 flow, removed 248 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:50,694 INFO L231 Difference]: Finished difference. Result has 86 places, 157 transitions, 2488 flow [2022-12-13 13:35:50,694 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2488, PETRI_PLACES=86, PETRI_TRANSITIONS=157} [2022-12-13 13:35:50,695 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 67 predicate places. [2022-12-13 13:35:50,695 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:50,695 INFO L89 Accepts]: Start accepts. Operand has 86 places, 157 transitions, 2488 flow [2022-12-13 13:35:50,697 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:50,697 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:50,697 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 157 transitions, 2488 flow [2022-12-13 13:35:50,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 157 transitions, 2488 flow [2022-12-13 13:35:50,836 INFO L130 PetriNetUnfolder]: 698/1695 cut-off events. [2022-12-13 13:35:50,836 INFO L131 PetriNetUnfolder]: For 8926/9686 co-relation queries the response was YES. [2022-12-13 13:35:50,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7657 conditions, 1695 events. 698/1695 cut-off events. For 8926/9686 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13535 event pairs, 446 based on Foata normal form. 3/1482 useless extension candidates. Maximal degree in co-relation 6785. Up to 1034 conditions per place. [2022-12-13 13:35:50,854 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 157 transitions, 2488 flow [2022-12-13 13:35:50,854 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 13:35:50,856 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:50,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 161 [2022-12-13 13:35:50,857 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 157 transitions, 2488 flow [2022-12-13 13:35:50,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:50,857 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:50,857 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:50,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 13:35:51,062 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-13 13:35:51,062 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-13 13:35:51,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1575795841, now seen corresponding path program 1 times [2022-12-13 13:35:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:51,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142580444] [2022-12-13 13:35:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:51,532 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-13 13:35:51,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:51,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142580444] [2022-12-13 13:35:51,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142580444] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:51,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991070751] [2022-12-13 13:35:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:51,534 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-13 13:35:51,537 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-13 13:35:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:51,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 13:35:51,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:51,676 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-13 13:35:51,685 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-13 13:35:51,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:51,711 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:35:51,712 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-13 13:35:51,729 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-13 13:35:51,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991070751] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:51,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:51,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 13:35:51,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997092606] [2022-12-13 13:35:51,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:51,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:35:51,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:51,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:35:51,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:35:51,731 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:35:51,731 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 157 transitions, 2488 flow. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:51,731 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:51,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:35:51,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:52,695 INFO L130 PetriNetUnfolder]: 1979/3730 cut-off events. [2022-12-13 13:35:52,695 INFO L131 PetriNetUnfolder]: For 34260/34260 co-relation queries the response was YES. [2022-12-13 13:35:52,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22929 conditions, 3730 events. 1979/3730 cut-off events. For 34260/34260 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 26129 event pairs, 359 based on Foata normal form. 11/3741 useless extension candidates. Maximal degree in co-relation 20685. Up to 2023 conditions per place. [2022-12-13 13:35:52,719 INFO L137 encePairwiseOnDemand]: 15/25 looper letters, 218 selfloop transitions, 119 changer transitions 61/398 dead transitions. [2022-12-13 13:35:52,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 398 transitions, 5592 flow [2022-12-13 13:35:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 13:35:52,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-13 13:35:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2022-12-13 13:35:52,721 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.376 [2022-12-13 13:35:52,721 INFO L175 Difference]: Start difference. First operand has 86 places, 157 transitions, 2488 flow. Second operand 20 states and 188 transitions. [2022-12-13 13:35:52,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 398 transitions, 5592 flow [2022-12-13 13:35:52,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 398 transitions, 5360 flow, removed 104 selfloop flow, removed 1 redundant places. [2022-12-13 13:35:52,776 INFO L231 Difference]: Finished difference. Result has 110 places, 210 transitions, 3690 flow [2022-12-13 13:35:52,777 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3690, PETRI_PLACES=110, PETRI_TRANSITIONS=210} [2022-12-13 13:35:52,777 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 91 predicate places. [2022-12-13 13:35:52,777 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:52,777 INFO L89 Accepts]: Start accepts. Operand has 110 places, 210 transitions, 3690 flow [2022-12-13 13:35:52,779 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:52,779 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:52,779 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 210 transitions, 3690 flow [2022-12-13 13:35:52,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 210 transitions, 3690 flow [2022-12-13 13:35:52,996 INFO L130 PetriNetUnfolder]: 987/2397 cut-off events. [2022-12-13 13:35:52,997 INFO L131 PetriNetUnfolder]: For 13978/15256 co-relation queries the response was YES. [2022-12-13 13:35:53,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10916 conditions, 2397 events. 987/2397 cut-off events. For 13978/15256 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 20831 event pairs, 650 based on Foata normal form. 2/2061 useless extension candidates. Maximal degree in co-relation 9711. Up to 1496 conditions per place. [2022-12-13 13:35:53,012 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 210 transitions, 3690 flow [2022-12-13 13:35:53,012 INFO L226 LiptonReduction]: Number of co-enabled transitions 1056 [2022-12-13 13:35:53,013 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:53,014 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-13 13:35:53,014 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 210 transitions, 3690 flow [2022-12-13 13:35:53,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:53,014 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:53,014 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:53,018 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-13 13:35:53,214 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-13 13:35:53,215 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-13 13:35:53,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:53,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1616671093, now seen corresponding path program 2 times [2022-12-13 13:35:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:53,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830541341] [2022-12-13 13:35:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:53,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:53,820 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-13 13:35:53,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:53,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830541341] [2022-12-13 13:35:53,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830541341] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:53,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55400365] [2022-12-13 13:35:53,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:35:53,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:53,824 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-13 13:35:53,851 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-13 13:35:53,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:35:53,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:35:53,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 13:35:53,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:53,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:35:53,994 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-13 13:35:54,039 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-13 13:35:54,047 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-13 13:35:54,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:54,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:35:54,108 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-13 13:35:54,124 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-13 13:35:54,165 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-13 13:35:54,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55400365] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:54,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:54,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-13 13:35:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240982992] [2022-12-13 13:35:54,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:54,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:35:54,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:54,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:35:54,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=199, Unknown=1, NotChecked=0, Total=240 [2022-12-13 13:35:54,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:35:54,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 210 transitions, 3690 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-13 13:35:54,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:54,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:35:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:55,269 INFO L130 PetriNetUnfolder]: 2503/4700 cut-off events. [2022-12-13 13:35:55,269 INFO L131 PetriNetUnfolder]: For 46994/46994 co-relation queries the response was YES. [2022-12-13 13:35:55,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29349 conditions, 4700 events. 2503/4700 cut-off events. For 46994/46994 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 34053 event pairs, 583 based on Foata normal form. 4/4704 useless extension candidates. Maximal degree in co-relation 25962. Up to 2573 conditions per place. [2022-12-13 13:35:55,294 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 178 selfloop transitions, 126 changer transitions 31/335 dead transitions. [2022-12-13 13:35:55,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 335 transitions, 5654 flow [2022-12-13 13:35:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:35:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:35:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-12-13 13:35:55,297 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3781818181818182 [2022-12-13 13:35:55,297 INFO L175 Difference]: Start difference. First operand has 110 places, 210 transitions, 3690 flow. Second operand 11 states and 104 transitions. [2022-12-13 13:35:55,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 335 transitions, 5654 flow [2022-12-13 13:35:55,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 335 transitions, 5304 flow, removed 130 selfloop flow, removed 4 redundant places. [2022-12-13 13:35:55,389 INFO L231 Difference]: Finished difference. Result has 122 places, 244 transitions, 4494 flow [2022-12-13 13:35:55,389 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3413, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4494, PETRI_PLACES=122, PETRI_TRANSITIONS=244} [2022-12-13 13:35:55,389 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 103 predicate places. [2022-12-13 13:35:55,390 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:55,390 INFO L89 Accepts]: Start accepts. Operand has 122 places, 244 transitions, 4494 flow [2022-12-13 13:35:55,393 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:55,393 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:55,393 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 244 transitions, 4494 flow [2022-12-13 13:35:55,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 244 transitions, 4494 flow [2022-12-13 13:35:55,635 INFO L130 PetriNetUnfolder]: 1195/2921 cut-off events. [2022-12-13 13:35:55,635 INFO L131 PetriNetUnfolder]: For 17095/18869 co-relation queries the response was YES. [2022-12-13 13:35:55,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13304 conditions, 2921 events. 1195/2921 cut-off events. For 17095/18869 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 26484 event pairs, 833 based on Foata normal form. 2/2472 useless extension candidates. Maximal degree in co-relation 12381. Up to 1864 conditions per place. [2022-12-13 13:35:55,655 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 244 transitions, 4494 flow [2022-12-13 13:35:55,655 INFO L226 LiptonReduction]: Number of co-enabled transitions 1312 [2022-12-13 13:35:55,656 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:35:55,657 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-13 13:35:55,657 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 244 transitions, 4494 flow [2022-12-13 13:35:55,657 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-13 13:35:55,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:55,657 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:55,666 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-13 13:35:55,866 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-13 13:35:55,866 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-13 13:35:55,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:55,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1502931877, now seen corresponding path program 3 times [2022-12-13 13:35:55,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:55,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661839686] [2022-12-13 13:35:55,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:55,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:35:55,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:55,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661839686] [2022-12-13 13:35:55,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661839686] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:55,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511184983] [2022-12-13 13:35:55,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:35:55,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:55,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:55,947 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-13 13:35:55,949 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-13 13:35:56,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:35:56,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:35:56,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:35:56,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 13:35:56,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:35:56,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511184983] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:35:56,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:35:56,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-12-13 13:35:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333580675] [2022-12-13 13:35:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:35:56,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:35:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:35:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:35:56,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:35:56,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 244 transitions, 4494 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:56,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:56,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:35:56,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:35:56,579 INFO L130 PetriNetUnfolder]: 1483/2852 cut-off events. [2022-12-13 13:35:56,580 INFO L131 PetriNetUnfolder]: For 29934/29934 co-relation queries the response was YES. [2022-12-13 13:35:56,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18237 conditions, 2852 events. 1483/2852 cut-off events. For 29934/29934 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19385 event pairs, 1010 based on Foata normal form. 56/2908 useless extension candidates. Maximal degree in co-relation 18102. Up to 2422 conditions per place. [2022-12-13 13:35:56,594 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 108 selfloop transitions, 0 changer transitions 51/159 dead transitions. [2022-12-13 13:35:56,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 159 transitions, 3101 flow [2022-12-13 13:35:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:35:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:35:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-13 13:35:56,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.384 [2022-12-13 13:35:56,595 INFO L175 Difference]: Start difference. First operand has 122 places, 244 transitions, 4494 flow. Second operand 5 states and 48 transitions. [2022-12-13 13:35:56,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 159 transitions, 3101 flow [2022-12-13 13:35:56,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 2744 flow, removed 58 selfloop flow, removed 14 redundant places. [2022-12-13 13:35:56,665 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1779 flow [2022-12-13 13:35:56,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1779, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2022-12-13 13:35:56,666 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 85 predicate places. [2022-12-13 13:35:56,666 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:35:56,666 INFO L89 Accepts]: Start accepts. Operand has 104 places, 108 transitions, 1779 flow [2022-12-13 13:35:56,667 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:35:56,667 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:35:56,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 108 transitions, 1779 flow [2022-12-13 13:35:56,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 108 transitions, 1779 flow [2022-12-13 13:35:56,766 INFO L130 PetriNetUnfolder]: 519/1345 cut-off events. [2022-12-13 13:35:56,766 INFO L131 PetriNetUnfolder]: For 4337/4868 co-relation queries the response was YES. [2022-12-13 13:35:56,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1345 events. 519/1345 cut-off events. For 4337/4868 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 11012 event pairs, 434 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 4763. Up to 935 conditions per place. [2022-12-13 13:35:56,779 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 108 transitions, 1779 flow [2022-12-13 13:35:56,779 INFO L226 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-13 13:35:56,780 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:56,780 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:56,781 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:56,781 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:35:57,956 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:35:57,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1291 [2022-12-13 13:35:57,957 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 107 transitions, 1780 flow [2022-12-13 13:35:57,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:57,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:35:57,958 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:35:57,962 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-13 13:35:58,162 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-13 13:35:58,162 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-13 13:35:58,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:35:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 71539580, now seen corresponding path program 1 times [2022-12-13 13:35:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:35:58,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332479404] [2022-12-13 13:35:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:35:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:58,505 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-13 13:35:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:35:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332479404] [2022-12-13 13:35:58,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332479404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:35:58,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858431024] [2022-12-13 13:35:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:35:58,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:35:58,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:35:58,507 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-13 13:35:58,536 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-13 13:35:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:35:58,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:35:58,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:35:58,780 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 13:35:58,781 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 23 treesize of output 10 [2022-12-13 13:35:58,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-13 13:35:58,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:35:58,868 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:35:58,868 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-13 13:35:58,990 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-13 13:35:58,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858431024] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:35:58,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:35:58,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 13:35:58,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373205879] [2022-12-13 13:35:58,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:35:58,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:35:58,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:35:58,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:35:58,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:35:58,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 13:35:58,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 107 transitions, 1780 flow. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:35:58,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:35:58,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 13:35:58,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:00,144 INFO L130 PetriNetUnfolder]: 1509/2822 cut-off events. [2022-12-13 13:36:00,144 INFO L131 PetriNetUnfolder]: For 20790/20790 co-relation queries the response was YES. [2022-12-13 13:36:00,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15805 conditions, 2822 events. 1509/2822 cut-off events. For 20790/20790 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18780 event pairs, 408 based on Foata normal form. 1/2823 useless extension candidates. Maximal degree in co-relation 14833. Up to 1602 conditions per place. [2022-12-13 13:36:00,154 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 162 selfloop transitions, 41 changer transitions 30/233 dead transitions. [2022-12-13 13:36:00,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 233 transitions, 3245 flow [2022-12-13 13:36:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:36:00,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:36:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 134 transitions. [2022-12-13 13:36:00,161 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5254901960784314 [2022-12-13 13:36:00,161 INFO L175 Difference]: Start difference. First operand has 87 places, 107 transitions, 1780 flow. Second operand 15 states and 134 transitions. [2022-12-13 13:36:00,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 233 transitions, 3245 flow [2022-12-13 13:36:00,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 233 transitions, 2770 flow, removed 196 selfloop flow, removed 12 redundant places. [2022-12-13 13:36:00,232 INFO L231 Difference]: Finished difference. Result has 94 places, 120 transitions, 1833 flow [2022-12-13 13:36:00,232 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1833, PETRI_PLACES=94, PETRI_TRANSITIONS=120} [2022-12-13 13:36:00,233 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 75 predicate places. [2022-12-13 13:36:00,233 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:00,233 INFO L89 Accepts]: Start accepts. Operand has 94 places, 120 transitions, 1833 flow [2022-12-13 13:36:00,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:00,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:00,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 120 transitions, 1833 flow [2022-12-13 13:36:00,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 120 transitions, 1833 flow [2022-12-13 13:36:00,310 INFO L130 PetriNetUnfolder]: 607/1566 cut-off events. [2022-12-13 13:36:00,311 INFO L131 PetriNetUnfolder]: For 2899/2912 co-relation queries the response was YES. [2022-12-13 13:36:00,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 1566 events. 607/1566 cut-off events. For 2899/2912 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 13581 event pairs, 506 based on Foata normal form. 1/1258 useless extension candidates. Maximal degree in co-relation 4027. Up to 1089 conditions per place. [2022-12-13 13:36:00,320 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 120 transitions, 1833 flow [2022-12-13 13:36:00,320 INFO L226 LiptonReduction]: Number of co-enabled transitions 760 [2022-12-13 13:36:00,321 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:00,321 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:00,321 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:00,322 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:00,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:00,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-13 13:36:00,530 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 120 transitions, 1844 flow [2022-12-13 13:36:00,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:00,531 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:00,531 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:00,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:00,735 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-13 13:36:00,736 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-13 13:36:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash -827640194, now seen corresponding path program 1 times [2022-12-13 13:36:00,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:00,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111215855] [2022-12-13 13:36:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:00,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:01,304 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-13 13:36:01,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:01,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111215855] [2022-12-13 13:36:01,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111215855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:01,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387647108] [2022-12-13 13:36:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:01,308 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-13 13:36:01,335 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-13 13:36:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:01,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 13:36:01,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:01,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:01,512 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-13 13:36:01,556 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-13 13:36:01,562 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-13 13:36:01,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:01,584 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_532) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)))) is different from false [2022-12-13 13:36:01,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:01,602 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-13 13:36:01,607 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-13 13:36:01,679 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-13 13:36:01,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387647108] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:01,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:01,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-13 13:36:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851671453] [2022-12-13 13:36:01,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:01,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:36:01,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:01,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:36:01,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=264, Unknown=1, NotChecked=32, Total=342 [2022-12-13 13:36:01,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 13:36:01,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 120 transitions, 1844 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-13 13:36:01,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:01,682 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 13:36:01,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:02,497 INFO L130 PetriNetUnfolder]: 1952/3631 cut-off events. [2022-12-13 13:36:02,497 INFO L131 PetriNetUnfolder]: For 18971/18971 co-relation queries the response was YES. [2022-12-13 13:36:02,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16967 conditions, 3631 events. 1952/3631 cut-off events. For 18971/18971 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 24920 event pairs, 248 based on Foata normal form. 4/3635 useless extension candidates. Maximal degree in co-relation 16521. Up to 2067 conditions per place. [2022-12-13 13:36:02,512 INFO L137 encePairwiseOnDemand]: 4/18 looper letters, 77 selfloop transitions, 129 changer transitions 38/244 dead transitions. [2022-12-13 13:36:02,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 244 transitions, 3322 flow [2022-12-13 13:36:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:36:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:36:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 117 transitions. [2022-12-13 13:36:02,516 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2022-12-13 13:36:02,516 INFO L175 Difference]: Start difference. First operand has 94 places, 120 transitions, 1844 flow. Second operand 14 states and 117 transitions. [2022-12-13 13:36:02,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 244 transitions, 3322 flow [2022-12-13 13:36:02,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 244 transitions, 3111 flow, removed 56 selfloop flow, removed 6 redundant places. [2022-12-13 13:36:02,621 INFO L231 Difference]: Finished difference. Result has 104 places, 158 transitions, 2574 flow [2022-12-13 13:36:02,621 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2574, PETRI_PLACES=104, PETRI_TRANSITIONS=158} [2022-12-13 13:36:02,621 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 85 predicate places. [2022-12-13 13:36:02,621 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:02,621 INFO L89 Accepts]: Start accepts. Operand has 104 places, 158 transitions, 2574 flow [2022-12-13 13:36:02,623 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:02,623 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:02,623 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 158 transitions, 2574 flow [2022-12-13 13:36:02,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 158 transitions, 2574 flow [2022-12-13 13:36:02,753 INFO L130 PetriNetUnfolder]: 1052/2423 cut-off events. [2022-12-13 13:36:02,754 INFO L131 PetriNetUnfolder]: For 6269/6633 co-relation queries the response was YES. [2022-12-13 13:36:02,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8529 conditions, 2423 events. 1052/2423 cut-off events. For 6269/6633 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 20310 event pairs, 650 based on Foata normal form. 10/2051 useless extension candidates. Maximal degree in co-relation 8331. Up to 1557 conditions per place. [2022-12-13 13:36:02,768 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 158 transitions, 2574 flow [2022-12-13 13:36:02,768 INFO L226 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-13 13:36:05,721 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:05,722 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3101 [2022-12-13 13:36:05,722 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 158 transitions, 2600 flow [2022-12-13 13:36:05,722 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-13 13:36:05,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:05,722 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:05,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:05,927 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-13 13:36:05,927 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-13 13:36:05,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1347619308, now seen corresponding path program 1 times [2022-12-13 13:36:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:05,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051748104] [2022-12-13 13:36:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:06,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:06,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051748104] [2022-12-13 13:36:06,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051748104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:06,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683610299] [2022-12-13 13:36:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:06,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:06,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:06,287 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-13 13:36:06,289 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-13 13:36:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:06,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-13 13:36:06,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:06,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:06,495 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-13 13:36:06,620 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-12-13 13:36:06,621 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 24 treesize of output 10 [2022-12-13 13:36:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:06,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:06,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:06,741 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 45 treesize of output 41 [2022-12-13 13:36:06,776 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-13 13:36:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:06,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683610299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:06,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:06,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 13:36:06,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012688656] [2022-12-13 13:36:06,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:06,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:36:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:06,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:36:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=254, Unknown=4, NotChecked=0, Total=306 [2022-12-13 13:36:06,829 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 13:36:06,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 158 transitions, 2600 flow. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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-13 13:36:06,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:06,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 13:36:06,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:08,933 INFO L130 PetriNetUnfolder]: 2678/4990 cut-off events. [2022-12-13 13:36:08,933 INFO L131 PetriNetUnfolder]: For 32347/32347 co-relation queries the response was YES. [2022-12-13 13:36:08,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26008 conditions, 4990 events. 2678/4990 cut-off events. For 32347/32347 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 36769 event pairs, 613 based on Foata normal form. 12/4995 useless extension candidates. Maximal degree in co-relation 24888. Up to 2795 conditions per place. [2022-12-13 13:36:08,957 INFO L137 encePairwiseOnDemand]: 10/20 looper letters, 237 selfloop transitions, 107 changer transitions 46/390 dead transitions. [2022-12-13 13:36:08,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 390 transitions, 5426 flow [2022-12-13 13:36:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 13:36:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-13 13:36:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 215 transitions. [2022-12-13 13:36:08,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4479166666666667 [2022-12-13 13:36:08,959 INFO L175 Difference]: Start difference. First operand has 104 places, 158 transitions, 2600 flow. Second operand 24 states and 215 transitions. [2022-12-13 13:36:08,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 390 transitions, 5426 flow [2022-12-13 13:36:09,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 390 transitions, 5249 flow, removed 69 selfloop flow, removed 1 redundant places. [2022-12-13 13:36:09,048 INFO L231 Difference]: Finished difference. Result has 141 places, 218 transitions, 3868 flow [2022-12-13 13:36:09,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3868, PETRI_PLACES=141, PETRI_TRANSITIONS=218} [2022-12-13 13:36:09,049 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 122 predicate places. [2022-12-13 13:36:09,049 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:09,049 INFO L89 Accepts]: Start accepts. Operand has 141 places, 218 transitions, 3868 flow [2022-12-13 13:36:09,051 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:09,051 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:09,051 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 218 transitions, 3868 flow [2022-12-13 13:36:09,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 218 transitions, 3868 flow [2022-12-13 13:36:09,267 INFO L130 PetriNetUnfolder]: 1360/3219 cut-off events. [2022-12-13 13:36:09,267 INFO L131 PetriNetUnfolder]: For 12468/12956 co-relation queries the response was YES. [2022-12-13 13:36:09,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11897 conditions, 3219 events. 1360/3219 cut-off events. For 12468/12956 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 29547 event pairs, 950 based on Foata normal form. 13/2699 useless extension candidates. Maximal degree in co-relation 11543. Up to 2118 conditions per place. [2022-12-13 13:36:09,301 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 218 transitions, 3868 flow [2022-12-13 13:36:09,302 INFO L226 LiptonReduction]: Number of co-enabled transitions 1348 [2022-12-13 13:36:09,303 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,303 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,303 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,304 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,589 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,590 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,590 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,590 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,713 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,713 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,713 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,713 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:09,809 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:36:09,809 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 760 [2022-12-13 13:36:09,809 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 218 transitions, 3881 flow [2022-12-13 13:36:09,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 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-13 13:36:09,810 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:09,810 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:09,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 13:36:10,011 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-13 13:36:10,012 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1722540087, now seen corresponding path program 2 times [2022-12-13 13:36:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:10,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907765298] [2022-12-13 13:36:10,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:10,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:10,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907765298] [2022-12-13 13:36:10,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907765298] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:10,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671442556] [2022-12-13 13:36:10,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:36:10,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:10,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:10,155 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:10,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:36:10,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:36:10,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:36:10,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 13:36:10,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:10,316 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:10,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:10,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671442556] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:10,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:10,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2022-12-13 13:36:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773747503] [2022-12-13 13:36:10,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:10,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:36:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:10,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:36:10,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:36:10,403 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:36:10,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 218 transitions, 3881 flow. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:10,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:10,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:36:10,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:11,498 INFO L130 PetriNetUnfolder]: 3240/6113 cut-off events. [2022-12-13 13:36:11,498 INFO L131 PetriNetUnfolder]: For 60249/60249 co-relation queries the response was YES. [2022-12-13 13:36:11,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34484 conditions, 6113 events. 3240/6113 cut-off events. For 60249/60249 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 47241 event pairs, 605 based on Foata normal form. 120/6217 useless extension candidates. Maximal degree in co-relation 33829. Up to 3480 conditions per place. [2022-12-13 13:36:11,520 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 131 selfloop transitions, 204 changer transitions 29/364 dead transitions. [2022-12-13 13:36:11,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 364 transitions, 6052 flow [2022-12-13 13:36:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 13:36:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 13:36:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 147 transitions. [2022-12-13 13:36:11,522 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44545454545454544 [2022-12-13 13:36:11,522 INFO L175 Difference]: Start difference. First operand has 140 places, 218 transitions, 3881 flow. Second operand 15 states and 147 transitions. [2022-12-13 13:36:11,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 364 transitions, 6052 flow [2022-12-13 13:36:11,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 364 transitions, 5862 flow, removed 93 selfloop flow, removed 2 redundant places. [2022-12-13 13:36:11,825 INFO L231 Difference]: Finished difference. Result has 156 places, 261 transitions, 5021 flow [2022-12-13 13:36:11,826 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3480, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5021, PETRI_PLACES=156, PETRI_TRANSITIONS=261} [2022-12-13 13:36:11,826 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 137 predicate places. [2022-12-13 13:36:11,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:11,826 INFO L89 Accepts]: Start accepts. Operand has 156 places, 261 transitions, 5021 flow [2022-12-13 13:36:11,830 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:11,830 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:11,830 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 261 transitions, 5021 flow [2022-12-13 13:36:11,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 261 transitions, 5021 flow [2022-12-13 13:36:12,200 INFO L130 PetriNetUnfolder]: 1656/3967 cut-off events. [2022-12-13 13:36:12,200 INFO L131 PetriNetUnfolder]: For 18344/18881 co-relation queries the response was YES. [2022-12-13 13:36:12,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15438 conditions, 3967 events. 1656/3967 cut-off events. For 18344/18881 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 37951 event pairs, 1201 based on Foata normal form. 19/3325 useless extension candidates. Maximal degree in co-relation 15185. Up to 2626 conditions per place. [2022-12-13 13:36:12,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 261 transitions, 5021 flow [2022-12-13 13:36:12,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 1604 [2022-12-13 13:36:12,276 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:12,276 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:12,358 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:12,359 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 533 [2022-12-13 13:36:12,359 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 261 transitions, 5028 flow [2022-12-13 13:36:12,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:12,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:12,359 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:12,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 13:36:12,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 13:36:12,565 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash 168939260, now seen corresponding path program 2 times [2022-12-13 13:36:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:12,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159043111] [2022-12-13 13:36:12,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:12,890 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-13 13:36:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:12,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159043111] [2022-12-13 13:36:12,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159043111] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:12,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669838003] [2022-12-13 13:36:12,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:36:12,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:12,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:12,896 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:12,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:36:13,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:36:13,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:36:13,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-13 13:36:13,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:13,211 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 13:36:13,211 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 23 treesize of output 10 [2022-12-13 13:36:13,217 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-13 13:36:13,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:13,252 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-13 13:36:13,253 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 24 treesize of output 15 [2022-12-13 13:36:13,431 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-13 13:36:13,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669838003] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:13,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:13,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-13 13:36:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693237717] [2022-12-13 13:36:13,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:13,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:36:13,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:13,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:36:13,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:36:13,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-13 13:36:13,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 261 transitions, 5028 flow. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:13,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:13,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-13 13:36:13,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:16,565 INFO L130 PetriNetUnfolder]: 3358/6496 cut-off events. [2022-12-13 13:36:16,565 INFO L131 PetriNetUnfolder]: For 75179/75179 co-relation queries the response was YES. [2022-12-13 13:36:16,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38052 conditions, 6496 events. 3358/6496 cut-off events. For 75179/75179 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 50922 event pairs, 332 based on Foata normal form. 164/6660 useless extension candidates. Maximal degree in co-relation 37873. Up to 3781 conditions per place. [2022-12-13 13:36:16,596 INFO L137 encePairwiseOnDemand]: 10/22 looper letters, 264 selfloop transitions, 214 changer transitions 234/712 dead transitions. [2022-12-13 13:36:16,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 712 transitions, 9959 flow [2022-12-13 13:36:16,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-13 13:36:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-13 13:36:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 540 transitions. [2022-12-13 13:36:16,602 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-13 13:36:16,602 INFO L175 Difference]: Start difference. First operand has 156 places, 261 transitions, 5028 flow. Second operand 60 states and 540 transitions. [2022-12-13 13:36:16,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 712 transitions, 9959 flow [2022-12-13 13:36:16,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 712 transitions, 9204 flow, removed 305 selfloop flow, removed 18 redundant places. [2022-12-13 13:36:16,958 INFO L231 Difference]: Finished difference. Result has 212 places, 264 transitions, 5341 flow [2022-12-13 13:36:16,958 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3611, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=5341, PETRI_PLACES=212, PETRI_TRANSITIONS=264} [2022-12-13 13:36:16,959 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 193 predicate places. [2022-12-13 13:36:16,959 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:16,959 INFO L89 Accepts]: Start accepts. Operand has 212 places, 264 transitions, 5341 flow [2022-12-13 13:36:16,961 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:16,961 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:16,961 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 264 transitions, 5341 flow [2022-12-13 13:36:16,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 264 transitions, 5341 flow [2022-12-13 13:36:17,310 INFO L130 PetriNetUnfolder]: 1553/3752 cut-off events. [2022-12-13 13:36:17,310 INFO L131 PetriNetUnfolder]: For 26333/26676 co-relation queries the response was YES. [2022-12-13 13:36:17,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15046 conditions, 3752 events. 1553/3752 cut-off events. For 26333/26676 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 35009 event pairs, 1136 based on Foata normal form. 0/3163 useless extension candidates. Maximal degree in co-relation 14956. Up to 2470 conditions per place. [2022-12-13 13:36:17,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 264 transitions, 5341 flow [2022-12-13 13:36:17,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 1490 [2022-12-13 13:36:17,363 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:17,364 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:17,462 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:17,463 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:17,463 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:17,463 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:17,562 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:36:17,563 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 604 [2022-12-13 13:36:17,563 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 263 transitions, 5327 flow [2022-12-13 13:36:17,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:17,564 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:17,564 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:17,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:17,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:17,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:17,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:17,773 INFO L85 PathProgramCache]: Analyzing trace with hash 665906612, now seen corresponding path program 1 times [2022-12-13 13:36:17,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:17,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731319980] [2022-12-13 13:36:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:18,053 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-13 13:36:18,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:18,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731319980] [2022-12-13 13:36:18,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731319980] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:18,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360388090] [2022-12-13 13:36:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:18,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:18,056 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:18,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:36:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:18,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 13:36:18,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:18,272 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 25 treesize of output 7 [2022-12-13 13:36:18,281 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-13 13:36:18,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:18,320 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:36:18,320 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-13 13:36:18,410 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-13 13:36:18,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360388090] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:18,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:18,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-12-13 13:36:18,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794039380] [2022-12-13 13:36:18,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:18,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:36:18,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:36:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:36:18,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-13 13:36:18,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 263 transitions, 5327 flow. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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-13 13:36:18,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:18,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-13 13:36:18,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:20,089 INFO L130 PetriNetUnfolder]: 3133/5979 cut-off events. [2022-12-13 13:36:20,089 INFO L131 PetriNetUnfolder]: For 74816/74816 co-relation queries the response was YES. [2022-12-13 13:36:20,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35802 conditions, 5979 events. 3133/5979 cut-off events. For 74816/74816 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 45725 event pairs, 1024 based on Foata normal form. 1/5980 useless extension candidates. Maximal degree in co-relation 35441. Up to 4471 conditions per place. [2022-12-13 13:36:20,117 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 281 selfloop transitions, 61 changer transitions 63/405 dead transitions. [2022-12-13 13:36:20,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 405 transitions, 7509 flow [2022-12-13 13:36:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 13:36:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-13 13:36:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 165 transitions. [2022-12-13 13:36:20,119 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2022-12-13 13:36:20,119 INFO L175 Difference]: Start difference. First operand has 190 places, 263 transitions, 5327 flow. Second operand 19 states and 165 transitions. [2022-12-13 13:36:20,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 405 transitions, 7509 flow [2022-12-13 13:36:20,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 405 transitions, 6391 flow, removed 269 selfloop flow, removed 29 redundant places. [2022-12-13 13:36:20,388 INFO L231 Difference]: Finished difference. Result has 186 places, 276 transitions, 4759 flow [2022-12-13 13:36:20,388 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4352, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4759, PETRI_PLACES=186, PETRI_TRANSITIONS=276} [2022-12-13 13:36:20,388 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 167 predicate places. [2022-12-13 13:36:20,388 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:20,388 INFO L89 Accepts]: Start accepts. Operand has 186 places, 276 transitions, 4759 flow [2022-12-13 13:36:20,390 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:20,390 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:20,390 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 276 transitions, 4759 flow [2022-12-13 13:36:20,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 276 transitions, 4759 flow [2022-12-13 13:36:20,657 INFO L130 PetriNetUnfolder]: 1608/3888 cut-off events. [2022-12-13 13:36:20,657 INFO L131 PetriNetUnfolder]: For 24879/25229 co-relation queries the response was YES. [2022-12-13 13:36:20,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14448 conditions, 3888 events. 1608/3888 cut-off events. For 24879/25229 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 36494 event pairs, 1187 based on Foata normal form. 3/3291 useless extension candidates. Maximal degree in co-relation 13777. Up to 2545 conditions per place. [2022-12-13 13:36:20,708 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 276 transitions, 4759 flow [2022-12-13 13:36:20,708 INFO L226 LiptonReduction]: Number of co-enabled transitions 1560 [2022-12-13 13:36:20,843 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-13 13:36:20,994 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-13 13:36:21,170 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,170 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,171 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,171 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,299 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,299 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,299 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,299 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,398 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-13 13:36:21,501 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,501 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,501 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,501 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,597 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,598 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,598 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,598 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,690 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,691 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,691 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,691 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:21,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [503] L52-->L52: Formula: (let ((.cse1 (select |v_#memory_int_277| v_~queue~0.base_168)) (.cse2 (* v_~back~0_293 4))) (and (not (= (ite (let ((.cse0 (+ v_~back~0_293 1))) (and (<= 0 .cse0) (< .cse0 v_~n~0_152))) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_233| 256) 0)) (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_168 4))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_232| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_293) (< v_~back~0_293 v_~n~0_152)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131| 0)) (not (= (ite (= 5 (select .cse1 (+ .cse2 v_~queue~0.offset_168))) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|) (= v_~back~0_291 (+ v_~back~0_293 2)))) InVars {~queue~0.offset=v_~queue~0.offset_168, ~back~0=v_~back~0_293, #memory_int=|v_#memory_int_277|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_233|, ~queue~0.base=v_~queue~0.base_168, ~n~0=v_~n~0_152} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_131|, ~queue~0.offset=v_~queue~0.offset_168, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_131|, ~back~0=v_~back~0_291, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_131|, #memory_int=|v_#memory_int_277|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_131|, ~queue~0.base=v_~queue~0.base_168, ~n~0=v_~n~0_152} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_232|] 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-13 13:36:22,050 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [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] and [505] L52-->L52: Formula: (let ((.cse1 (* v_~back~0_297 4)) (.cse0 (select |v_#memory_int_279| v_~queue~0.base_170))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_239| 256) 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_240| 256) 0)) (= v_~back~0_297 (+ v_~back~0_299 3)) (not (= (ite (= 5 (select .cse0 (+ .cse1 v_~queue~0.offset_170 (- 8)))) 1 0) 0)) (not (= (ite (and (< v_~back~0_299 v_~n~0_154) (<= 0 v_~back~0_299)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135| 0)) (not (= (ite (and (<= 1 v_~back~0_297) (< v_~back~0_297 (+ v_~n~0_154 1))) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_237| 256) 0)) (= (ite (= 5 (select .cse0 (+ .cse1 (- 4) v_~queue~0.offset_170))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|) (not (= (ite (= 5 (select .cse0 (+ (* v_~back~0_299 4) v_~queue~0.offset_170))) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_170, ~back~0=v_~back~0_299, #memory_int=|v_#memory_int_279|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_240|, ~queue~0.base=v_~queue~0.base_170, ~n~0=v_~n~0_154} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_135|, ~queue~0.offset=v_~queue~0.offset_170, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_135|, ~back~0=v_~back~0_297, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_135|, #memory_int=|v_#memory_int_279|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_135|, ~queue~0.base=v_~queue~0.base_170, ~n~0=v_~n~0_154} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_237|, |v_thread1Thread1of1ForFork0_#t~nondet1#1_239|] 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-13 13:36:22,204 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 [506] L80-4-->L52: Formula: (let ((.cse0 (select |v_#memory_int_281| v_~queue~0.base_172)) (.cse1 (* v_~back~0_304 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_245| 256) 0)) (= v_~back~0_303 (+ v_~back~0_304 2)) (not (= (ite (= 5 (select .cse0 (+ .cse1 v_~queue~0.offset_172))) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~back~0_304 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_156))) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_117| |v_#pthreadsForks_112|) (not (= (ite (and (< v_~back~0_304 v_~n~0_156) (<= 0 v_~back~0_304)) 1 0) 0)) (= (+ |v_#pthreadsForks_112| 1) |v_#pthreadsForks_111|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139| 0)) (= (ite (= 5 (select .cse0 (+ .cse1 v_~queue~0.offset_172 4))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|) (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2~0#1.base_78| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2~0#1.base_78|) |v_ULTIMATE.start_main_~#t2~0#1.offset_77| |v_ULTIMATE.start_main_#t~pre12#1_117|)) |v_#memory_int_281|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_247| 256) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_172, #pthreadsForks=|v_#pthreadsForks_112|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_77|, ~back~0=v_~back~0_304, #memory_int=|v_#memory_int_282|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_247|, ~queue~0.base=v_~queue~0.base_172, ~n~0=v_~n~0_156, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} OutVars{~queue~0.offset=v_~queue~0.offset_172, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_77|, ~back~0=v_~back~0_303, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_139|, ~queue~0.base=v_~queue~0.base_172, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_139|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_117|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_87|, #pthreadsForks=|v_#pthreadsForks_111|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_139|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_113|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_139|, #memory_int=|v_#memory_int_281|, ~n~0=v_~n~0_156, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_245|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, ULTIMATE.start_main_#t~pre10#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] [2022-12-13 13:36:22,204 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,204 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,204 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,204 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,475 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 [507] L80-4-->L52: Formula: (let ((.cse0 (select |v_#memory_int_285| v_~queue~0.base_174)) (.cse1 (* v_~back~0_307 4))) (and (= v_~back~0_307 (+ v_~back~0_308 3)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_251| 256) 0)) (not (= (ite (= 5 (select .cse0 (+ (* v_~back~0_308 4) v_~queue~0.offset_174))) 1 0) 0)) (not (= (ite (= 5 (select .cse0 (+ .cse1 v_~queue~0.offset_174 (- 8)))) 1 0) 0)) (= |v_ULTIMATE.start_main_#t~pre12#1_119| |v_#pthreadsForks_116|) (= (ite (= (select .cse0 (+ (- 4) .cse1 v_~queue~0.offset_174)) 5) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_252| 256) 0)) (not (= (ite (and (<= 1 v_~back~0_307) (< v_~back~0_307 (+ v_~n~0_158 1))) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_254| 256) 0)) (not (= (ite (and (<= 0 v_~back~0_308) (< v_~back~0_308 v_~n~0_158)) 1 0) 0)) (= |v_#pthreadsForks_115| (+ |v_#pthreadsForks_116| 1)) (= (store |v_#memory_int_286| |v_ULTIMATE.start_main_~#t2~0#1.base_80| (store (select |v_#memory_int_286| |v_ULTIMATE.start_main_~#t2~0#1.base_80|) |v_ULTIMATE.start_main_~#t2~0#1.offset_79| |v_ULTIMATE.start_main_#t~pre12#1_119|)) |v_#memory_int_285|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141| 0)))) InVars {~queue~0.offset=v_~queue~0.offset_174, #pthreadsForks=|v_#pthreadsForks_116|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_79|, ~back~0=v_~back~0_308, #memory_int=|v_#memory_int_286|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_254|, ~queue~0.base=v_~queue~0.base_174, ~n~0=v_~n~0_158, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_80|} OutVars{~queue~0.offset=v_~queue~0.offset_174, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_79|, ~back~0=v_~back~0_307, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_141|, ~queue~0.base=v_~queue~0.base_174, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_141|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_119|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_89|, #pthreadsForks=|v_#pthreadsForks_115|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_141|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_115|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_141|, #memory_int=|v_#memory_int_285|, ~n~0=v_~n~0_158, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_80|} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_251|, |v_thread1Thread1of1ForFork0_#t~nondet1#1_252|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post3#1, ULTIMATE.start_main_#t~pre10#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] [2022-12-13 13:36:22,475 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,476 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,476 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,476 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:22,813 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 13:36:22,813 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2425 [2022-12-13 13:36:22,814 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 276 transitions, 4844 flow [2022-12-13 13:36:22,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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-13 13:36:22,814 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:22,814 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:22,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:23,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:23,015 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:23,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1482349147, now seen corresponding path program 1 times [2022-12-13 13:36:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:23,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899617365] [2022-12-13 13:36:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:23,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:23,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899617365] [2022-12-13 13:36:23,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899617365] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:23,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743622709] [2022-12-13 13:36:23,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:23,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:23,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:23,549 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:23,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:36:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:23,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-13 13:36:23,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:23,795 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-13 13:36:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:23,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:23,825 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:36:23,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2022-12-13 13:36:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:23,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743622709] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:23,850 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:23,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 13:36:23,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141504546] [2022-12-13 13:36:23,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:23,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 13:36:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:23,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 13:36:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2022-12-13 13:36:23,853 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 13:36:23,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 276 transitions, 4844 flow. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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-13 13:36:23,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:23,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 13:36:23,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:26,270 INFO L130 PetriNetUnfolder]: 4924/9269 cut-off events. [2022-12-13 13:36:26,270 INFO L131 PetriNetUnfolder]: For 108333/108333 co-relation queries the response was YES. [2022-12-13 13:36:26,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50362 conditions, 9269 events. 4924/9269 cut-off events. For 108333/108333 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 75078 event pairs, 601 based on Foata normal form. 62/9327 useless extension candidates. Maximal degree in co-relation 50059. Up to 5283 conditions per place. [2022-12-13 13:36:26,323 INFO L137 encePairwiseOnDemand]: 12/25 looper letters, 267 selfloop transitions, 360 changer transitions 184/811 dead transitions. [2022-12-13 13:36:26,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 811 transitions, 11619 flow [2022-12-13 13:36:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-13 13:36:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-13 13:36:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 435 transitions. [2022-12-13 13:36:26,324 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3551020408163265 [2022-12-13 13:36:26,325 INFO L175 Difference]: Start difference. First operand has 176 places, 276 transitions, 4844 flow. Second operand 49 states and 435 transitions. [2022-12-13 13:36:26,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 811 transitions, 11619 flow [2022-12-13 13:36:26,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 811 transitions, 11135 flow, removed 191 selfloop flow, removed 10 redundant places. [2022-12-13 13:36:26,692 INFO L231 Difference]: Finished difference. Result has 228 places, 404 transitions, 7960 flow [2022-12-13 13:36:26,693 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=7960, PETRI_PLACES=228, PETRI_TRANSITIONS=404} [2022-12-13 13:36:26,693 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 209 predicate places. [2022-12-13 13:36:26,693 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:26,693 INFO L89 Accepts]: Start accepts. Operand has 228 places, 404 transitions, 7960 flow [2022-12-13 13:36:26,696 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:26,696 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:26,696 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 404 transitions, 7960 flow [2022-12-13 13:36:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 404 transitions, 7960 flow [2022-12-13 13:36:27,222 INFO L130 PetriNetUnfolder]: 2292/5576 cut-off events. [2022-12-13 13:36:27,222 INFO L131 PetriNetUnfolder]: For 22317/22892 co-relation queries the response was YES. [2022-12-13 13:36:27,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20427 conditions, 5576 events. 2292/5576 cut-off events. For 22317/22892 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 56144 event pairs, 1773 based on Foata normal form. 2/4666 useless extension candidates. Maximal degree in co-relation 20056. Up to 3734 conditions per place. [2022-12-13 13:36:27,275 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 404 transitions, 7960 flow [2022-12-13 13:36:27,275 INFO L226 LiptonReduction]: Number of co-enabled transitions 2362 [2022-12-13 13:36:27,277 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-13 13:36:27,375 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,375 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,375 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,375 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,466 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,467 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,467 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,467 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:27,558 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L52-->L52: Formula: (let ((.cse0 (select |v_#memory_int_302| v_~queue~0.base_184)) (.cse1 (* v_~back~0_340 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_289| 256) 0)) (= v_~back~0_338 (+ v_~back~0_340 2)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_290| 256) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~queue~0.offset_184)) 5) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~queue~0.offset_184 4)) 5) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|) (not (= (ite (and (< v_~back~0_340 v_~n~0_168) (<= 0 v_~back~0_340)) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~back~0_340 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_168))) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_184, ~back~0=v_~back~0_340, #memory_int=|v_#memory_int_302|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_290|, ~queue~0.base=v_~queue~0.base_184, ~n~0=v_~n~0_168} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|, ~queue~0.offset=v_~queue~0.offset_184, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_161|, ~back~0=v_~back~0_338, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|, #memory_int=|v_#memory_int_302|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_161|, ~queue~0.base=v_~queue~0.base_184, ~n~0=v_~n~0_168} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_289|] 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-13 13:36:27,700 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [516] L52-->L52: Formula: (let ((.cse0 (select |v_#memory_int_302| v_~queue~0.base_184)) (.cse1 (* v_~back~0_340 4))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_289| 256) 0)) (= v_~back~0_338 (+ v_~back~0_340 2)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_290| 256) 0)) (not (= (ite (= (select .cse0 (+ .cse1 v_~queue~0.offset_184)) 5) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161| 0)) (= (ite (= (select .cse0 (+ .cse1 v_~queue~0.offset_184 4)) 5) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|) (not (= (ite (and (< v_~back~0_340 v_~n~0_168) (<= 0 v_~back~0_340)) 1 0) 0)) (not (= (ite (let ((.cse2 (+ v_~back~0_340 1))) (and (<= 0 .cse2) (< .cse2 v_~n~0_168))) 1 0) 0)))) InVars {~queue~0.offset=v_~queue~0.offset_184, ~back~0=v_~back~0_340, #memory_int=|v_#memory_int_302|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_290|, ~queue~0.base=v_~queue~0.base_184, ~n~0=v_~n~0_168} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_161|, ~queue~0.offset=v_~queue~0.offset_184, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_161|, ~back~0=v_~back~0_338, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_161|, #memory_int=|v_#memory_int_302|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_161|, ~queue~0.base=v_~queue~0.base_184, ~n~0=v_~n~0_168} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_289|] 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-13 13:36:27,845 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 13:36:27,846 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1153 [2022-12-13 13:36:27,846 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 404 transitions, 7988 flow [2022-12-13 13:36:27,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 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-13 13:36:27,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:27,847 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:27,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:28,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:28,051 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:28,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1690280402, now seen corresponding path program 1 times [2022-12-13 13:36:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:28,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436520666] [2022-12-13 13:36:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:28,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:36:28,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:28,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436520666] [2022-12-13 13:36:28,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436520666] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:28,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643954193] [2022-12-13 13:36:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:28,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:28,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:28,127 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:28,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 13:36:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:28,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:36:28,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:36:28,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:36:28,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643954193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:36:28,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:36:28,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:36:28,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630548382] [2022-12-13 13:36:28,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:36:28,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:36:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:36:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:36:28,280 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-13 13:36:28,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 404 transitions, 7988 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-13 13:36:28,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:28,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-13 13:36:28,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:29,650 INFO L130 PetriNetUnfolder]: 4713/8831 cut-off events. [2022-12-13 13:36:29,650 INFO L131 PetriNetUnfolder]: For 82892/82892 co-relation queries the response was YES. [2022-12-13 13:36:29,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50702 conditions, 8831 events. 4713/8831 cut-off events. For 82892/82892 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 71601 event pairs, 3258 based on Foata normal form. 1/8832 useless extension candidates. Maximal degree in co-relation 50323. Up to 6649 conditions per place. [2022-12-13 13:36:29,695 INFO L137 encePairwiseOnDemand]: 27/29 looper letters, 411 selfloop transitions, 1 changer transitions 1/413 dead transitions. [2022-12-13 13:36:29,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 413 transitions, 8905 flow [2022-12-13 13:36:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:36:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:36:29,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-13 13:36:29,696 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2022-12-13 13:36:29,696 INFO L175 Difference]: Start difference. First operand has 219 places, 404 transitions, 7988 flow. Second operand 3 states and 41 transitions. [2022-12-13 13:36:29,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 413 transitions, 8905 flow [2022-12-13 13:36:30,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 413 transitions, 8442 flow, removed 223 selfloop flow, removed 11 redundant places. [2022-12-13 13:36:30,124 INFO L231 Difference]: Finished difference. Result has 209 places, 402 transitions, 7489 flow [2022-12-13 13:36:30,124 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=7487, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=7489, PETRI_PLACES=209, PETRI_TRANSITIONS=402} [2022-12-13 13:36:30,124 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 190 predicate places. [2022-12-13 13:36:30,125 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:30,125 INFO L89 Accepts]: Start accepts. Operand has 209 places, 402 transitions, 7489 flow [2022-12-13 13:36:30,127 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:30,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:30,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 402 transitions, 7489 flow [2022-12-13 13:36:30,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 402 transitions, 7489 flow [2022-12-13 13:36:30,685 INFO L130 PetriNetUnfolder]: 2295/5578 cut-off events. [2022-12-13 13:36:30,685 INFO L131 PetriNetUnfolder]: For 19046/19579 co-relation queries the response was YES. [2022-12-13 13:36:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19836 conditions, 5578 events. 2295/5578 cut-off events. For 19046/19579 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 56337 event pairs, 1768 based on Foata normal form. 2/4685 useless extension candidates. Maximal degree in co-relation 19327. Up to 3718 conditions per place. [2022-12-13 13:36:30,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 402 transitions, 7489 flow [2022-12-13 13:36:30,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 2336 [2022-12-13 13:36:30,737 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 13:36:30,738 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 613 [2022-12-13 13:36:30,738 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 402 transitions, 7489 flow [2022-12-13 13:36:30,738 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-13 13:36:30,738 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:30,738 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:30,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:30,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:30,940 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:30,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:30,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1593569644, now seen corresponding path program 1 times [2022-12-13 13:36:30,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:30,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798477267] [2022-12-13 13:36:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:36:31,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:31,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798477267] [2022-12-13 13:36:31,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798477267] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:31,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011016023] [2022-12-13 13:36:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:31,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:31,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:31,016 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:31,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 13:36:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:31,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:36:31,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 13:36:31,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:36:31,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011016023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:36:31,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:36:31,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-13 13:36:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652035856] [2022-12-13 13:36:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:36:31,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:36:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:31,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:36:31,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:36:31,209 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:36:31,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 402 transitions, 7489 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-13 13:36:31,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:31,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:36:31,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:32,613 INFO L130 PetriNetUnfolder]: 4685/8790 cut-off events. [2022-12-13 13:36:32,614 INFO L131 PetriNetUnfolder]: For 72320/72320 co-relation queries the response was YES. [2022-12-13 13:36:32,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48329 conditions, 8790 events. 4685/8790 cut-off events. For 72320/72320 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 71222 event pairs, 3246 based on Foata normal form. 12/8802 useless extension candidates. Maximal degree in co-relation 47492. Up to 6649 conditions per place. [2022-12-13 13:36:32,665 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 405 selfloop transitions, 1 changer transitions 12/418 dead transitions. [2022-12-13 13:36:32,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 418 transitions, 8475 flow [2022-12-13 13:36:32,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:36:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:36:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 13:36:32,666 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-13 13:36:32,666 INFO L175 Difference]: Start difference. First operand has 209 places, 402 transitions, 7489 flow. Second operand 4 states and 49 transitions. [2022-12-13 13:36:32,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 418 transitions, 8475 flow [2022-12-13 13:36:33,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 418 transitions, 8474 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:36:33,032 INFO L231 Difference]: Finished difference. Result has 211 places, 396 transitions, 7391 flow [2022-12-13 13:36:33,032 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7455, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=7391, PETRI_PLACES=211, PETRI_TRANSITIONS=396} [2022-12-13 13:36:33,033 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 192 predicate places. [2022-12-13 13:36:33,033 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:33,033 INFO L89 Accepts]: Start accepts. Operand has 211 places, 396 transitions, 7391 flow [2022-12-13 13:36:33,036 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:33,036 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:33,036 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 396 transitions, 7391 flow [2022-12-13 13:36:33,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 396 transitions, 7391 flow [2022-12-13 13:36:33,495 INFO L130 PetriNetUnfolder]: 2264/5497 cut-off events. [2022-12-13 13:36:33,495 INFO L131 PetriNetUnfolder]: For 18875/19380 co-relation queries the response was YES. [2022-12-13 13:36:33,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19558 conditions, 5497 events. 2264/5497 cut-off events. For 18875/19380 co-relation queries the response was YES. Maximal size of possible extension queue 617. Compared 55328 event pairs, 1741 based on Foata normal form. 2/4617 useless extension candidates. Maximal degree in co-relation 19375. Up to 3660 conditions per place. [2022-12-13 13:36:33,547 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 209 places, 396 transitions, 7391 flow [2022-12-13 13:36:33,547 INFO L226 LiptonReduction]: Number of co-enabled transitions 2308 [2022-12-13 13:36:33,549 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:33,550 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:36:33,626 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:33,626 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 593 [2022-12-13 13:36:33,626 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 396 transitions, 7397 flow [2022-12-13 13:36:33,627 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-13 13:36:33,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:33,627 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:33,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:33,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 13:36:33,831 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:33,832 INFO L85 PathProgramCache]: Analyzing trace with hash -839148423, now seen corresponding path program 2 times [2022-12-13 13:36:33,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:33,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257022854] [2022-12-13 13:36:33,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:33,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:34,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:34,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257022854] [2022-12-13 13:36:34,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257022854] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:34,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593884641] [2022-12-13 13:36:34,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:36:34,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:34,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:34,402 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:34,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 13:36:34,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 13:36:34,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:36:34,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 13:36:34,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:34,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:34,620 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-13 13:36:34,682 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-13 13:36:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:34,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:34,705 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_878) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 8)) 5)) is different from false [2022-12-13 13:36:34,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:34,717 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-13 13:36:34,727 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-13 13:36:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 13:36:34,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593884641] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:34,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:34,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2022-12-13 13:36:34,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432740596] [2022-12-13 13:36:34,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:34,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 13:36:34,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 13:36:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=334, Unknown=1, NotChecked=36, Total=420 [2022-12-13 13:36:34,797 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-13 13:36:34,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 396 transitions, 7397 flow. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:34,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:34,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-13 13:36:34,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:37,504 INFO L130 PetriNetUnfolder]: 7327/13546 cut-off events. [2022-12-13 13:36:37,505 INFO L131 PetriNetUnfolder]: For 128685/128685 co-relation queries the response was YES. [2022-12-13 13:36:37,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74722 conditions, 13546 events. 7327/13546 cut-off events. For 128685/128685 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 113958 event pairs, 1361 based on Foata normal form. 28/13574 useless extension candidates. Maximal degree in co-relation 74364. Up to 7696 conditions per place. [2022-12-13 13:36:37,581 INFO L137 encePairwiseOnDemand]: 10/28 looper letters, 260 selfloop transitions, 432 changer transitions 55/747 dead transitions. [2022-12-13 13:36:37,582 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 747 transitions, 14037 flow [2022-12-13 13:36:37,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 13:36:37,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 13:36:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 174 transitions. [2022-12-13 13:36:37,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-13 13:36:37,583 INFO L175 Difference]: Start difference. First operand has 209 places, 396 transitions, 7397 flow. Second operand 18 states and 174 transitions. [2022-12-13 13:36:37,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 747 transitions, 14037 flow [2022-12-13 13:36:38,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 747 transitions, 14008 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 13:36:38,023 INFO L231 Difference]: Finished difference. Result has 238 places, 610 transitions, 13497 flow [2022-12-13 13:36:38,023 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=7380, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=13497, PETRI_PLACES=238, PETRI_TRANSITIONS=610} [2022-12-13 13:36:38,024 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 219 predicate places. [2022-12-13 13:36:38,024 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:38,024 INFO L89 Accepts]: Start accepts. Operand has 238 places, 610 transitions, 13497 flow [2022-12-13 13:36:38,028 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:38,028 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:38,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 610 transitions, 13497 flow [2022-12-13 13:36:38,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 610 transitions, 13497 flow [2022-12-13 13:36:39,129 INFO L130 PetriNetUnfolder]: 4033/9174 cut-off events. [2022-12-13 13:36:39,129 INFO L131 PetriNetUnfolder]: For 57311/59386 co-relation queries the response was YES. [2022-12-13 13:36:39,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46260 conditions, 9174 events. 4033/9174 cut-off events. For 57311/59386 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 93791 event pairs, 2345 based on Foata normal form. 6/7973 useless extension candidates. Maximal degree in co-relation 45410. Up to 5669 conditions per place. [2022-12-13 13:36:39,237 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 610 transitions, 13497 flow [2022-12-13 13:36:39,237 INFO L226 LiptonReduction]: Number of co-enabled transitions 3460 [2022-12-13 13:36:39,240 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-13 13:36:39,334 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-13 13:36:39,433 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 13:36:39,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1410 [2022-12-13 13:36:39,434 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 610 transitions, 13517 flow [2022-12-13 13:36:39,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:39,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:39,435 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:39,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-12-13 13:36:39,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 13:36:39,641 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1791651531, now seen corresponding path program 1 times [2022-12-13 13:36:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:39,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707865751] [2022-12-13 13:36:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:40,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:40,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:40,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707865751] [2022-12-13 13:36:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707865751] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:40,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222064350] [2022-12-13 13:36:40,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:40,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:40,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:40,240 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:40,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 13:36:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:40,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 13:36:40,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:40,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:36:40,438 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-13 13:36:40,491 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-13 13:36:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:40,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:40,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:36:40,562 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-13 13:36:40,572 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-13 13:36:40,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:40,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222064350] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:40,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:40,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2022-12-13 13:36:40,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824867391] [2022-12-13 13:36:40,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:40,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 13:36:40,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:40,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 13:36:40,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2022-12-13 13:36:40,660 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-13 13:36:40,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 610 transitions, 13517 flow. Second operand has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:40,660 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:40,660 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-13 13:36:40,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:36:45,513 INFO L130 PetriNetUnfolder]: 9900/18439 cut-off events. [2022-12-13 13:36:45,513 INFO L131 PetriNetUnfolder]: For 252938/252938 co-relation queries the response was YES. [2022-12-13 13:36:45,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125598 conditions, 18439 events. 9900/18439 cut-off events. For 252938/252938 co-relation queries the response was YES. Maximal size of possible extension queue 1138. Compared 163566 event pairs, 1175 based on Foata normal form. 28/18467 useless extension candidates. Maximal degree in co-relation 124276. Up to 10292 conditions per place. [2022-12-13 13:36:45,620 INFO L137 encePairwiseOnDemand]: 15/30 looper letters, 140 selfloop transitions, 755 changer transitions 49/944 dead transitions. [2022-12-13 13:36:45,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 944 transitions, 20907 flow [2022-12-13 13:36:45,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:36:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-13 13:36:45,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 172 transitions. [2022-12-13 13:36:45,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33725490196078434 [2022-12-13 13:36:45,621 INFO L175 Difference]: Start difference. First operand has 238 places, 610 transitions, 13517 flow. Second operand 17 states and 172 transitions. [2022-12-13 13:36:45,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 944 transitions, 20907 flow [2022-12-13 13:36:46,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 944 transitions, 20349 flow, removed 257 selfloop flow, removed 6 redundant places. [2022-12-13 13:36:46,718 INFO L231 Difference]: Finished difference. Result has 261 places, 807 transitions, 20259 flow [2022-12-13 13:36:46,719 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=12973, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=20259, PETRI_PLACES=261, PETRI_TRANSITIONS=807} [2022-12-13 13:36:46,719 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 242 predicate places. [2022-12-13 13:36:46,719 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:36:46,719 INFO L89 Accepts]: Start accepts. Operand has 261 places, 807 transitions, 20259 flow [2022-12-13 13:36:46,726 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:36:46,726 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:36:46,726 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 807 transitions, 20259 flow [2022-12-13 13:36:46,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 807 transitions, 20259 flow [2022-12-13 13:36:48,435 INFO L130 PetriNetUnfolder]: 5486/12585 cut-off events. [2022-12-13 13:36:48,435 INFO L131 PetriNetUnfolder]: For 87467/90605 co-relation queries the response was YES. [2022-12-13 13:36:48,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64211 conditions, 12585 events. 5486/12585 cut-off events. For 87467/90605 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 136794 event pairs, 3723 based on Foata normal form. 6/10827 useless extension candidates. Maximal degree in co-relation 63129. Up to 7953 conditions per place. [2022-12-13 13:36:48,688 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 807 transitions, 20259 flow [2022-12-13 13:36:48,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 4876 [2022-12-13 13:36:52,159 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:36:52,160 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5441 [2022-12-13 13:36:52,160 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 807 transitions, 20303 flow [2022-12-13 13:36:52,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:52,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:36:52,161 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:36:52,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 13:36:52,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:52,367 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:36:52,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:36:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash 955999175, now seen corresponding path program 3 times [2022-12-13 13:36:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:36:52,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924557689] [2022-12-13 13:36:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:36:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:36:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:36:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:36:52,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924557689] [2022-12-13 13:36:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924557689] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:36:52,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987110092] [2022-12-13 13:36:52,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:36:52,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:36:52,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:36:52,808 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:36:52,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 13:36:53,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 13:36:53,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:36:53,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 13:36:53,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:36:53,307 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-13 13:36:53,308 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 23 treesize of output 10 [2022-12-13 13:36:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:53,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:36:53,424 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:36:53,424 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-13 13:36:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:36:53,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987110092] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:36:53,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:36:53,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-13 13:36:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943530082] [2022-12-13 13:36:53,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:36:53,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 13:36:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:36:53,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 13:36:53,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-12-13 13:36:53,657 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-13 13:36:53,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 807 transitions, 20303 flow. Second operand has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:36:53,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:36:53,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-13 13:36:53,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:16,013 INFO L130 PetriNetUnfolder]: 23116/42989 cut-off events. [2022-12-13 13:37:16,013 INFO L131 PetriNetUnfolder]: For 1013675/1013675 co-relation queries the response was YES. [2022-12-13 13:37:16,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314003 conditions, 42989 events. 23116/42989 cut-off events. For 1013675/1013675 co-relation queries the response was YES. Maximal size of possible extension queue 1872. Compared 412582 event pairs, 2452 based on Foata normal form. 111/43099 useless extension candidates. Maximal degree in co-relation 310239. Up to 24055 conditions per place. [2022-12-13 13:37:16,473 INFO L137 encePairwiseOnDemand]: 15/32 looper letters, 1209 selfloop transitions, 1484 changer transitions 225/2918 dead transitions. [2022-12-13 13:37:16,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 2918 transitions, 65482 flow [2022-12-13 13:37:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-12-13 13:37:16,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2022-12-13 13:37:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 1437 transitions. [2022-12-13 13:37:16,477 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.27892080745341613 [2022-12-13 13:37:16,477 INFO L175 Difference]: Start difference. First operand has 261 places, 807 transitions, 20303 flow. Second operand 161 states and 1437 transitions. [2022-12-13 13:37:16,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 2918 transitions, 65482 flow [2022-12-13 13:37:20,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 2918 transitions, 60808 flow, removed 2257 selfloop flow, removed 2 redundant places. [2022-12-13 13:37:20,599 INFO L231 Difference]: Finished difference. Result has 488 places, 1881 transitions, 46789 flow [2022-12-13 13:37:20,600 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19768, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=502, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=161, PETRI_FLOW=46789, PETRI_PLACES=488, PETRI_TRANSITIONS=1881} [2022-12-13 13:37:20,601 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 469 predicate places. [2022-12-13 13:37:20,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:37:20,601 INFO L89 Accepts]: Start accepts. Operand has 488 places, 1881 transitions, 46789 flow [2022-12-13 13:37:20,627 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:37:20,628 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:37:20,628 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 488 places, 1881 transitions, 46789 flow [2022-12-13 13:37:20,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 487 places, 1881 transitions, 46789 flow [2022-12-13 13:37:27,884 INFO L130 PetriNetUnfolder]: 11952/28128 cut-off events. [2022-12-13 13:37:27,885 INFO L131 PetriNetUnfolder]: For 930394/936858 co-relation queries the response was YES. [2022-12-13 13:37:28,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154992 conditions, 28128 events. 11952/28128 cut-off events. For 930394/936858 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 337086 event pairs, 8609 based on Foata normal form. 32/23987 useless extension candidates. Maximal degree in co-relation 153289. Up to 17952 conditions per place. [2022-12-13 13:37:28,497 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 487 places, 1881 transitions, 46789 flow [2022-12-13 13:37:28,497 INFO L226 LiptonReduction]: Number of co-enabled transitions 11868 [2022-12-13 13:37:28,504 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,504 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,504 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,504 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,596 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,596 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,596 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,597 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,687 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,687 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,687 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,687 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,776 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,777 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,851 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,851 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,851 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:28,851 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,018 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,018 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,018 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,018 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,111 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,112 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,112 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,112 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,199 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,200 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,200 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,200 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,389 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] L52-->L52: Formula: (let ((.cse0 (select |v_#memory_int_334| v_~queue~0.base_205))) (and (not (= 0 (ite (= (select .cse0 (+ (* v_~back~0_395 4) v_~queue~0.offset_205)) 5) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|) (not (= (ite (and (<= 0 v_~back~0_395) (< v_~back~0_395 v_~n~0_186)) 1 0) 0)) (= v_~back~0_393 (+ v_~back~0_395 2)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_335| 256) 0)) (= (ite (= 5 (select .cse0 (+ (* v_~back~0_393 4) (- 4) v_~queue~0.offset_205))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_334| 256) 0)) (not (= (ite (and (<= 1 v_~back~0_393) (< v_~back~0_393 (+ v_~n~0_186 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190| 0)))) InVars {~queue~0.offset=v_~queue~0.offset_205, ~back~0=v_~back~0_395, #memory_int=|v_#memory_int_334|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_335|, ~queue~0.base=v_~queue~0.base_205, ~n~0=v_~n~0_186} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|, ~queue~0.offset=v_~queue~0.offset_205, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_190|, ~back~0=v_~back~0_393, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|, #memory_int=|v_#memory_int_334|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_190|, ~queue~0.base=v_~queue~0.base_205, ~n~0=v_~n~0_186} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_334|] 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-13 13:37:29,529 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [528] L52-->L52: Formula: (let ((.cse0 (select |v_#memory_int_334| v_~queue~0.base_205))) (and (not (= 0 (ite (= (select .cse0 (+ (* v_~back~0_395 4) v_~queue~0.offset_205)) 5) 1 0))) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|) (not (= (ite (and (<= 0 v_~back~0_395) (< v_~back~0_395 v_~n~0_186)) 1 0) 0)) (= v_~back~0_393 (+ v_~back~0_395 2)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_335| 256) 0)) (= (ite (= 5 (select .cse0 (+ (* v_~back~0_393 4) (- 4) v_~queue~0.offset_205))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_334| 256) 0)) (not (= (ite (and (<= 1 v_~back~0_393) (< v_~back~0_393 (+ v_~n~0_186 1))) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190| 0)))) InVars {~queue~0.offset=v_~queue~0.offset_205, ~back~0=v_~back~0_395, #memory_int=|v_#memory_int_334|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_335|, ~queue~0.base=v_~queue~0.base_205, ~n~0=v_~n~0_186} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_190|, ~queue~0.offset=v_~queue~0.offset_205, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_190|, ~back~0=v_~back~0_393, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_190|, #memory_int=|v_#memory_int_334|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_190|, ~queue~0.base=v_~queue~0.base_205, ~n~0=v_~n~0_186} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_334|] 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-13 13:37:29,636 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,636 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,636 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,636 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,729 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,729 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,729 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,729 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,818 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,819 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,819 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,819 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,930 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,930 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,930 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:29,930 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:37:30,052 INFO L241 LiptonReduction]: Total number of compositions: 12 [2022-12-13 13:37:30,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9452 [2022-12-13 13:37:30,053 INFO L495 AbstractCegarLoop]: Abstraction has has 487 places, 1881 transitions, 46894 flow [2022-12-13 13:37:30,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:37:30,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:37:30,053 INFO L214 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:37:30,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-12-13 13:37:30,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:30,258 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:37:30,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:37:30,259 INFO L85 PathProgramCache]: Analyzing trace with hash -251849833, now seen corresponding path program 1 times [2022-12-13 13:37:30,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:37:30,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176823840] [2022-12-13 13:37:30,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:30,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:37:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:37:30,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176823840] [2022-12-13 13:37:30,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176823840] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:37:30,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037845490] [2022-12-13 13:37:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:37:30,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:37:30,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:37:30,876 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:37:30,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 13:37:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:37:31,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:37:31,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:37:31,133 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-13 13:37:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:31,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:37:31,159 INFO L321 Elim1Store]: treesize reduction 5, result has 64.3 percent of original size [2022-12-13 13:37:31,160 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-13 13:37:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:37:31,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037845490] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:37:31,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:37:31,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-12-13 13:37:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250866100] [2022-12-13 13:37:31,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:37:31,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 13:37:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:37:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 13:37:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:37:31,183 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 45 [2022-12-13 13:37:31,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 1881 transitions, 46894 flow. Second operand has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-13 13:37:31,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:37:31,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 45 [2022-12-13 13:37:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:37:57,824 INFO L130 PetriNetUnfolder]: 26349/48875 cut-off events. [2022-12-13 13:37:57,824 INFO L131 PetriNetUnfolder]: For 1491725/1491725 co-relation queries the response was YES. [2022-12-13 13:37:58,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367711 conditions, 48875 events. 26349/48875 cut-off events. For 1491725/1491725 co-relation queries the response was YES. Maximal size of possible extension queue 2278. Compared 477212 event pairs, 8630 based on Foata normal form. 1/48720 useless extension candidates. Maximal degree in co-relation 362809. Up to 35040 conditions per place. [2022-12-13 13:37:58,879 INFO L137 encePairwiseOnDemand]: 25/45 looper letters, 1923 selfloop transitions, 569 changer transitions 105/2597 dead transitions. [2022-12-13 13:37:58,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 2597 transitions, 63079 flow [2022-12-13 13:37:58,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 13:37:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-12-13 13:37:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 353 transitions. [2022-12-13 13:37:58,881 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.22412698412698412 [2022-12-13 13:37:58,881 INFO L175 Difference]: Start difference. First operand has 487 places, 1881 transitions, 46894 flow. Second operand 35 states and 353 transitions. [2022-12-13 13:37:58,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 2597 transitions, 63079 flow [2022-12-13 13:38:13,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 2597 transitions, 54420 flow, removed 4292 selfloop flow, removed 8 redundant places. [2022-12-13 13:38:14,030 INFO L231 Difference]: Finished difference. Result has 527 places, 2093 transitions, 46830 flow [2022-12-13 13:38:14,031 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=40327, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1881, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=46830, PETRI_PLACES=527, PETRI_TRANSITIONS=2093} [2022-12-13 13:38:14,031 INFO L295 CegarLoopForPetriNet]: 19 programPoint places, 508 predicate places. [2022-12-13 13:38:14,031 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 13:38:14,032 INFO L89 Accepts]: Start accepts. Operand has 527 places, 2093 transitions, 46830 flow [2022-12-13 13:38:14,047 INFO L95 Accepts]: Finished accepts. [2022-12-13 13:38:14,047 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 13:38:14,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 527 places, 2093 transitions, 46830 flow [2022-12-13 13:38:14,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 527 places, 2093 transitions, 46830 flow [2022-12-13 13:38:21,321 INFO L130 PetriNetUnfolder]: 13495/31772 cut-off events. [2022-12-13 13:38:21,321 INFO L131 PetriNetUnfolder]: For 886495/893150 co-relation queries the response was YES. [2022-12-13 13:38:22,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163989 conditions, 31772 events. 13495/31772 cut-off events. For 886495/893150 co-relation queries the response was YES. Maximal size of possible extension queue 2304. Compared 387611 event pairs, 9642 based on Foata normal form. 27/27055 useless extension candidates. Maximal degree in co-relation 162172. Up to 20236 conditions per place. [2022-12-13 13:38:22,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 527 places, 2093 transitions, 46830 flow [2022-12-13 13:38:22,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 13490 [2022-12-13 13:38:22,439 WARN L322 ript$VariableManager]: TermVariable LBE59 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:38:22,439 WARN L322 ript$VariableManager]: TermVariable LBE208 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-13 13:38:22,529 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 13:38:22,530 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8499 [2022-12-13 13:38:22,530 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 2093 transitions, 46854 flow [2022-12-13 13:38:22,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0625) internal successors, (33), 16 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-13 13:38:22,530 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:38:22,530 INFO L214 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:38:22,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 13:38:22,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 13:38:22,731 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 13:38:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:38:22,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1880538125, now seen corresponding path program 1 times [2022-12-13 13:38:22,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:38:22,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586490932] [2022-12-13 13:38:22,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:38:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:22,836 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:38:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586490932] [2022-12-13 13:38:22,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586490932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:38:22,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40108423] [2022-12-13 13:38:22,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:38:22,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:38:22,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 13:38:22,840 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:38:22,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 13:38:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:38:22,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:38:22,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:38:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:22,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:38:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:38:23,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40108423] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:38:23,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:38:23,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 7] total 12 [2022-12-13 13:38:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732757879] [2022-12-13 13:38:23,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:38:23,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 13:38:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:38:23,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 13:38:23,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-12-13 13:38:23,091 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 13:38:23,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 2093 transitions, 46854 flow. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 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-13 13:38:23,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:38:23,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 13:38:23,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand