/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:21:17,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:21:17,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:21:17,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:21:17,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:21:17,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:21:17,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:21:17,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:21:17,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:21:17,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:21:17,257 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:21:17,258 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:21:17,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:21:17,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:21:17,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:21:17,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:21:17,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:21:17,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:21:17,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:21:17,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:21:17,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:21:17,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:21:17,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:21:17,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:21:17,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:21:17,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:21:17,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:21:17,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:21:17,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:21:17,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:21:17,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:21:17,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:21:17,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:21:17,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:21:17,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:21:17,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:21:17,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:21:17,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:21:17,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:21:17,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:21:17,302 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:21:17,312 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-NoLbe.epf [2022-12-11 19:21:17,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:21:17,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:21:17,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:21:17,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:21:17,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:21:17,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:21:17,337 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:21:17,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:21:17,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:21:17,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:21:17,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:21:17,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:21:17,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:21:17,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:21:17,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:21:17,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:21:17,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:21:17,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:21:17,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:21:17,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:21:17,339 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:21:17,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:21:17,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:21:17,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:21:17,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:21:17,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:21:17,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:21:17,340 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:21:17,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:21:17,341 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:21:17,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:21:17,341 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-11 19:21:17,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:21:17,654 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:21:17,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:21:17,657 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:21:17,657 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:21:17,658 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-12-11 19:21:18,733 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:21:18,949 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:21:18,950 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-trans.wvr.c [2022-12-11 19:21:18,959 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760775b6e/3f50e467a1374a5e9076fd12eee10655/FLAG1fa0c87bd [2022-12-11 19:21:18,970 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/760775b6e/3f50e467a1374a5e9076fd12eee10655 [2022-12-11 19:21:18,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:21:18,973 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:21:18,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:21:18,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:21:18,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:21:18,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:21:18" (1/1) ... [2022-12-11 19:21:18,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4adcd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:18, skipping insertion in model container [2022-12-11 19:21:18,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:21:18" (1/1) ... [2022-12-11 19:21:18,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:21:19,004 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:21:19,145 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/chl-file-item-trans.wvr.c[2817,2830] [2022-12-11 19:21:19,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:21:19,160 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:21:19,179 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/chl-file-item-trans.wvr.c[2817,2830] [2022-12-11 19:21:19,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:21:19,194 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:21:19,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19 WrapperNode [2022-12-11 19:21:19,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:21:19,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:21:19,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:21:19,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:21:19,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,254 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 193 [2022-12-11 19:21:19,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:21:19,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:21:19,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:21:19,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:21:19,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,293 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:21:19,297 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:21:19,297 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:21:19,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:21:19,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (1/1) ... [2022-12-11 19:21:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:21:19,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:21:19,331 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-11 19:21:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:21:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 19:21:19,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 19:21:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 19:21:19,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 19:21:19,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 19:21:19,375 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 19:21:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:21:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:21:19,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:21:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:21:19,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:21:19,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 19:21:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:21:19,379 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 19:21:19,363 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-11 19:21:19,540 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:21:19,542 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:21:19,838 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:21:19,848 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:21:19,848 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 19:21:19,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:21:19 BoogieIcfgContainer [2022-12-11 19:21:19,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:21:19,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:21:19,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:21:19,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:21:19,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:21:18" (1/3) ... [2022-12-11 19:21:19,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c46667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:21:19, skipping insertion in model container [2022-12-11 19:21:19,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:21:19" (2/3) ... [2022-12-11 19:21:19,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c46667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:21:19, skipping insertion in model container [2022-12-11 19:21:19,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:21:19" (3/3) ... [2022-12-11 19:21:19,858 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2022-12-11 19:21:19,874 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:21:19,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 19:21:19,875 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:21:19,957 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 19:21:19,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 225 transitions, 474 flow [2022-12-11 19:21:20,127 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-11 19:21:20,127 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:21:20,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 222 events. 19/222 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 498 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 152. Up to 2 conditions per place. [2022-12-11 19:21:20,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 225 transitions, 474 flow [2022-12-11 19:21:20,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 212 transitions, 442 flow [2022-12-11 19:21:20,162 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:21:20,169 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=PETRI_NET, 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;@498be8a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:21:20,169 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 19:21:20,233 INFO L130 PetriNetUnfolder]: 19/211 cut-off events. [2022-12-11 19:21:20,234 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:21:20,234 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:20,235 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:20,236 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:20,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:20,241 INFO L85 PathProgramCache]: Analyzing trace with hash 224942883, now seen corresponding path program 1 times [2022-12-11 19:21:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:20,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835767869] [2022-12-11 19:21:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:20,995 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-11 19:21:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:20,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835767869] [2022-12-11 19:21:20,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835767869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:20,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:20,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:21:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780625021] [2022-12-11 19:21:20,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:21,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:21:21,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:21,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:21:21,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:21:21,051 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 225 [2022-12-11 19:21:21,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 212 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 197.42857142857142) internal successors, (1382), 7 states have internal predecessors, (1382), 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-11 19:21:21,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:21,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 225 [2022-12-11 19:21:21,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:21,490 INFO L130 PetriNetUnfolder]: 142/1289 cut-off events. [2022-12-11 19:21:21,490 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-11 19:21:21,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 1289 events. 142/1289 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 10749 event pairs, 23 based on Foata normal form. 72/1196 useless extension candidates. Maximal degree in co-relation 1345. Up to 42 conditions per place. [2022-12-11 19:21:21,507 INFO L137 encePairwiseOnDemand]: 206/225 looper letters, 40 selfloop transitions, 8 changer transitions 7/238 dead transitions. [2022-12-11 19:21:21,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 238 transitions, 643 flow [2022-12-11 19:21:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:21:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:21:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2034 transitions. [2022-12-11 19:21:21,529 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.904 [2022-12-11 19:21:21,531 INFO L175 Difference]: Start difference. First operand has 203 places, 212 transitions, 442 flow. Second operand 10 states and 2034 transitions. [2022-12-11 19:21:21,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 238 transitions, 643 flow [2022-12-11 19:21:21,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 238 transitions, 605 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-11 19:21:21,543 INFO L231 Difference]: Finished difference. Result has 213 places, 211 transitions, 484 flow [2022-12-11 19:21:21,545 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=484, PETRI_PLACES=213, PETRI_TRANSITIONS=211} [2022-12-11 19:21:21,551 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 10 predicate places. [2022-12-11 19:21:21,552 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 211 transitions, 484 flow [2022-12-11 19:21:21,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 197.42857142857142) internal successors, (1382), 7 states have internal predecessors, (1382), 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-11 19:21:21,553 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:21,553 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:21,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:21:21,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:21,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:21,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2009967747, now seen corresponding path program 2 times [2022-12-11 19:21:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:21,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932628880] [2022-12-11 19:21:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:21,923 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-11 19:21:21,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932628880] [2022-12-11 19:21:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932628880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:21,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:21,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:21:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787543700] [2022-12-11 19:21:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:21,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:21:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:21:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:21:21,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 225 [2022-12-11 19:21:21,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 211 transitions, 484 flow. Second operand has 7 states, 7 states have (on average 197.42857142857142) internal successors, (1382), 7 states have internal predecessors, (1382), 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-11 19:21:21,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:21,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 225 [2022-12-11 19:21:21,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:22,312 INFO L130 PetriNetUnfolder]: 129/1156 cut-off events. [2022-12-11 19:21:22,312 INFO L131 PetriNetUnfolder]: For 190/190 co-relation queries the response was YES. [2022-12-11 19:21:22,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1651 conditions, 1156 events. 129/1156 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9431 event pairs, 9 based on Foata normal form. 1/1056 useless extension candidates. Maximal degree in co-relation 1617. Up to 69 conditions per place. [2022-12-11 19:21:22,326 INFO L137 encePairwiseOnDemand]: 212/225 looper letters, 54 selfloop transitions, 24 changer transitions 4/265 dead transitions. [2022-12-11 19:21:22,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 265 transitions, 869 flow [2022-12-11 19:21:22,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:21:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:21:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2025 transitions. [2022-12-11 19:21:22,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-12-11 19:21:22,338 INFO L175 Difference]: Start difference. First operand has 213 places, 211 transitions, 484 flow. Second operand 10 states and 2025 transitions. [2022-12-11 19:21:22,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 265 transitions, 869 flow [2022-12-11 19:21:22,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 265 transitions, 855 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:22,350 INFO L231 Difference]: Finished difference. Result has 220 places, 228 transitions, 662 flow [2022-12-11 19:21:22,350 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=662, PETRI_PLACES=220, PETRI_TRANSITIONS=228} [2022-12-11 19:21:22,352 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 17 predicate places. [2022-12-11 19:21:22,352 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 228 transitions, 662 flow [2022-12-11 19:21:22,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 197.42857142857142) internal successors, (1382), 7 states have internal predecessors, (1382), 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-11 19:21:22,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:22,354 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:22,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:21:22,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:22,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:22,355 INFO L85 PathProgramCache]: Analyzing trace with hash 83130193, now seen corresponding path program 3 times [2022-12-11 19:21:22,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:22,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146882848] [2022-12-11 19:21:22,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:22,615 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-11 19:21:22,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:22,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146882848] [2022-12-11 19:21:22,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146882848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:22,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:22,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:21:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214976715] [2022-12-11 19:21:22,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:22,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:21:22,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:22,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:21:22,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:21:22,620 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 225 [2022-12-11 19:21:22,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 228 transitions, 662 flow. Second operand has 8 states, 8 states have (on average 193.625) internal successors, (1549), 8 states have internal predecessors, (1549), 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-11 19:21:22,622 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:22,622 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 225 [2022-12-11 19:21:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:23,067 INFO L130 PetriNetUnfolder]: 380/2211 cut-off events. [2022-12-11 19:21:23,068 INFO L131 PetriNetUnfolder]: For 725/732 co-relation queries the response was YES. [2022-12-11 19:21:23,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3561 conditions, 2211 events. 380/2211 cut-off events. For 725/732 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 21060 event pairs, 58 based on Foata normal form. 1/2040 useless extension candidates. Maximal degree in co-relation 3528. Up to 256 conditions per place. [2022-12-11 19:21:23,090 INFO L137 encePairwiseOnDemand]: 211/225 looper letters, 52 selfloop transitions, 24 changer transitions 9/264 dead transitions. [2022-12-11 19:21:23,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 264 transitions, 952 flow [2022-12-11 19:21:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:21:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:21:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1792 transitions. [2022-12-11 19:21:23,094 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8849382716049383 [2022-12-11 19:21:23,094 INFO L175 Difference]: Start difference. First operand has 220 places, 228 transitions, 662 flow. Second operand 9 states and 1792 transitions. [2022-12-11 19:21:23,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 264 transitions, 952 flow [2022-12-11 19:21:23,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 264 transitions, 934 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:23,105 INFO L231 Difference]: Finished difference. Result has 228 places, 230 transitions, 744 flow [2022-12-11 19:21:23,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=744, PETRI_PLACES=228, PETRI_TRANSITIONS=230} [2022-12-11 19:21:23,106 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 25 predicate places. [2022-12-11 19:21:23,106 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 230 transitions, 744 flow [2022-12-11 19:21:23,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.625) internal successors, (1549), 8 states have internal predecessors, (1549), 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-11 19:21:23,107 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:23,107 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:23,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:21:23,108 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:23,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1502420647, now seen corresponding path program 1 times [2022-12-11 19:21:23,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:23,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44882596] [2022-12-11 19:21:23,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:23,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:23,249 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-11 19:21:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:23,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44882596] [2022-12-11 19:21:23,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44882596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:23,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:23,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:21:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063063979] [2022-12-11 19:21:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:23,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:21:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:23,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:21:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:21:23,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 225 [2022-12-11 19:21:23,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 230 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 200.28571428571428) internal successors, (1402), 7 states have internal predecessors, (1402), 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-11 19:21:23,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:23,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 225 [2022-12-11 19:21:23,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:23,551 INFO L130 PetriNetUnfolder]: 183/1275 cut-off events. [2022-12-11 19:21:23,551 INFO L131 PetriNetUnfolder]: For 328/456 co-relation queries the response was YES. [2022-12-11 19:21:23,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 1275 events. 183/1275 cut-off events. For 328/456 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11345 event pairs, 81 based on Foata normal form. 13/1185 useless extension candidates. Maximal degree in co-relation 1950. Up to 266 conditions per place. [2022-12-11 19:21:23,567 INFO L137 encePairwiseOnDemand]: 217/225 looper letters, 28 selfloop transitions, 5 changer transitions 4/249 dead transitions. [2022-12-11 19:21:23,567 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 876 flow [2022-12-11 19:21:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:21:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:21:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1820 transitions. [2022-12-11 19:21:23,571 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8987654320987655 [2022-12-11 19:21:23,571 INFO L175 Difference]: Start difference. First operand has 228 places, 230 transitions, 744 flow. Second operand 9 states and 1820 transitions. [2022-12-11 19:21:23,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 876 flow [2022-12-11 19:21:23,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 249 transitions, 830 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-11 19:21:23,577 INFO L231 Difference]: Finished difference. Result has 236 places, 234 transitions, 743 flow [2022-12-11 19:21:23,578 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=743, PETRI_PLACES=236, PETRI_TRANSITIONS=234} [2022-12-11 19:21:23,578 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 33 predicate places. [2022-12-11 19:21:23,578 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 234 transitions, 743 flow [2022-12-11 19:21:23,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.28571428571428) internal successors, (1402), 7 states have internal predecessors, (1402), 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-11 19:21:23,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:23,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:21:23,580 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:23,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1192478753, now seen corresponding path program 1 times [2022-12-11 19:21:23,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:23,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430342370] [2022-12-11 19:21:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:23,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:23,627 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-11 19:21:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:23,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430342370] [2022-12-11 19:21:23,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430342370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:23,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:23,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:21:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787311681] [2022-12-11 19:21:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:23,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:21:23,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:23,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:21:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:21:23,630 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 225 [2022-12-11 19:21:23,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 234 transitions, 743 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:23,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:23,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 225 [2022-12-11 19:21:23,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:24,028 INFO L130 PetriNetUnfolder]: 188/2726 cut-off events. [2022-12-11 19:21:24,029 INFO L131 PetriNetUnfolder]: For 466/505 co-relation queries the response was YES. [2022-12-11 19:21:24,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 2726 events. 188/2726 cut-off events. For 466/505 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 27281 event pairs, 21 based on Foata normal form. 0/2463 useless extension candidates. Maximal degree in co-relation 3601. Up to 107 conditions per place. [2022-12-11 19:21:24,055 INFO L137 encePairwiseOnDemand]: 219/225 looper letters, 15 selfloop transitions, 4 changer transitions 0/241 dead transitions. [2022-12-11 19:21:24,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 241 transitions, 800 flow [2022-12-11 19:21:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:21:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:21:24,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-12-11 19:21:24,057 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9422222222222222 [2022-12-11 19:21:24,057 INFO L175 Difference]: Start difference. First operand has 236 places, 234 transitions, 743 flow. Second operand 3 states and 636 transitions. [2022-12-11 19:21:24,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 241 transitions, 800 flow [2022-12-11 19:21:24,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 241 transitions, 795 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-11 19:21:24,067 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 766 flow [2022-12-11 19:21:24,067 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2022-12-11 19:21:24,068 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 32 predicate places. [2022-12-11 19:21:24,068 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 766 flow [2022-12-11 19:21:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:24,069 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:24,069 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:24,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:21:24,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1454441813, now seen corresponding path program 2 times [2022-12-11 19:21:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:24,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182218549] [2022-12-11 19:21:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:24,112 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-11 19:21:24,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:24,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182218549] [2022-12-11 19:21:24,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182218549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:24,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:24,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:21:24,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834191084] [2022-12-11 19:21:24,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:24,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:21:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:24,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:21:24,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:21:24,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 225 [2022-12-11 19:21:24,117 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:24,117 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:24,117 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 225 [2022-12-11 19:21:24,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:24,377 INFO L130 PetriNetUnfolder]: 124/1975 cut-off events. [2022-12-11 19:21:24,378 INFO L131 PetriNetUnfolder]: For 387/414 co-relation queries the response was YES. [2022-12-11 19:21:24,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2654 conditions, 1975 events. 124/1975 cut-off events. For 387/414 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 17569 event pairs, 26 based on Foata normal form. 12/1802 useless extension candidates. Maximal degree in co-relation 2231. Up to 65 conditions per place. [2022-12-11 19:21:24,401 INFO L137 encePairwiseOnDemand]: 221/225 looper letters, 19 selfloop transitions, 2 changer transitions 3/243 dead transitions. [2022-12-11 19:21:24,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 243 transitions, 831 flow [2022-12-11 19:21:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:21:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:21:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-12-11 19:21:24,403 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9422222222222222 [2022-12-11 19:21:24,403 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 766 flow. Second operand 3 states and 636 transitions. [2022-12-11 19:21:24,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 243 transitions, 831 flow [2022-12-11 19:21:24,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 243 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:24,412 INFO L231 Difference]: Finished difference. Result has 237 places, 235 transitions, 754 flow [2022-12-11 19:21:24,412 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=237, PETRI_TRANSITIONS=235} [2022-12-11 19:21:24,413 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 34 predicate places. [2022-12-11 19:21:24,413 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 235 transitions, 754 flow [2022-12-11 19:21:24,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:24,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:24,414 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:24,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:21:24,414 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:24,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1008584353, now seen corresponding path program 1 times [2022-12-11 19:21:24,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:24,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733154463] [2022-12-11 19:21:24,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:24,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:24,567 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-11 19:21:24,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:24,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733154463] [2022-12-11 19:21:24,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733154463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:24,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:24,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:21:24,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176385755] [2022-12-11 19:21:24,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:24,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:21:24,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:24,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:21:24,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:21:24,570 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 225 [2022-12-11 19:21:24,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 235 transitions, 754 flow. Second operand has 7 states, 7 states have (on average 196.42857142857142) internal successors, (1375), 7 states have internal predecessors, (1375), 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-11 19:21:24,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:24,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 225 [2022-12-11 19:21:24,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:25,280 INFO L130 PetriNetUnfolder]: 666/5211 cut-off events. [2022-12-11 19:21:25,281 INFO L131 PetriNetUnfolder]: For 506/663 co-relation queries the response was YES. [2022-12-11 19:21:25,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7192 conditions, 5211 events. 666/5211 cut-off events. For 506/663 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 64508 event pairs, 273 based on Foata normal form. 5/4583 useless extension candidates. Maximal degree in co-relation 6467. Up to 535 conditions per place. [2022-12-11 19:21:25,322 INFO L137 encePairwiseOnDemand]: 213/225 looper letters, 32 selfloop transitions, 7 changer transitions 10/262 dead transitions. [2022-12-11 19:21:25,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 262 transitions, 929 flow [2022-12-11 19:21:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:21:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:21:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1604 transitions. [2022-12-11 19:21:25,326 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8911111111111111 [2022-12-11 19:21:25,326 INFO L175 Difference]: Start difference. First operand has 237 places, 235 transitions, 754 flow. Second operand 8 states and 1604 transitions. [2022-12-11 19:21:25,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 262 transitions, 929 flow [2022-12-11 19:21:25,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 262 transitions, 915 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:25,340 INFO L231 Difference]: Finished difference. Result has 248 places, 240 transitions, 802 flow [2022-12-11 19:21:25,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=802, PETRI_PLACES=248, PETRI_TRANSITIONS=240} [2022-12-11 19:21:25,341 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 45 predicate places. [2022-12-11 19:21:25,341 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 240 transitions, 802 flow [2022-12-11 19:21:25,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.42857142857142) internal successors, (1375), 7 states have internal predecessors, (1375), 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-11 19:21:25,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:25,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:25,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 19:21:25,342 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:25,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2072775985, now seen corresponding path program 2 times [2022-12-11 19:21:25,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:25,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425582358] [2022-12-11 19:21:25,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:25,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:25,553 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-11 19:21:25,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:25,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425582358] [2022-12-11 19:21:25,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425582358] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:25,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:25,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 19:21:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215913411] [2022-12-11 19:21:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:25,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 19:21:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 19:21:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 19:21:25,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 225 [2022-12-11 19:21:25,558 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 240 transitions, 802 flow. Second operand has 8 states, 8 states have (on average 192.625) internal successors, (1541), 8 states have internal predecessors, (1541), 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-11 19:21:25,558 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:25,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 225 [2022-12-11 19:21:25,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:26,838 INFO L130 PetriNetUnfolder]: 1474/8632 cut-off events. [2022-12-11 19:21:26,839 INFO L131 PetriNetUnfolder]: For 5371/6595 co-relation queries the response was YES. [2022-12-11 19:21:26,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14463 conditions, 8632 events. 1474/8632 cut-off events. For 5371/6595 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 109778 event pairs, 773 based on Foata normal form. 198/7995 useless extension candidates. Maximal degree in co-relation 14403. Up to 1790 conditions per place. [2022-12-11 19:21:26,908 INFO L137 encePairwiseOnDemand]: 216/225 looper letters, 62 selfloop transitions, 11 changer transitions 10/287 dead transitions. [2022-12-11 19:21:26,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 287 transitions, 1207 flow [2022-12-11 19:21:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:21:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:21:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1968 transitions. [2022-12-11 19:21:26,913 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2022-12-11 19:21:26,913 INFO L175 Difference]: Start difference. First operand has 248 places, 240 transitions, 802 flow. Second operand 10 states and 1968 transitions. [2022-12-11 19:21:26,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 287 transitions, 1207 flow [2022-12-11 19:21:26,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 287 transitions, 1191 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:26,958 INFO L231 Difference]: Finished difference. Result has 259 places, 245 transitions, 866 flow [2022-12-11 19:21:26,959 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=866, PETRI_PLACES=259, PETRI_TRANSITIONS=245} [2022-12-11 19:21:26,959 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 56 predicate places. [2022-12-11 19:21:26,960 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 245 transitions, 866 flow [2022-12-11 19:21:26,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 192.625) internal successors, (1541), 8 states have internal predecessors, (1541), 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-11 19:21:26,961 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:26,961 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:26,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:21:26,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:26,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2025027789, now seen corresponding path program 3 times [2022-12-11 19:21:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:26,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512947381] [2022-12-11 19:21:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:27,149 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-11 19:21:27,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:27,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512947381] [2022-12-11 19:21:27,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512947381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:27,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:27,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:21:27,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631617670] [2022-12-11 19:21:27,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:27,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:21:27,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:27,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:21:27,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:21:27,153 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 225 [2022-12-11 19:21:27,155 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 245 transitions, 866 flow. Second operand has 7 states, 7 states have (on average 196.42857142857142) internal successors, (1375), 7 states have internal predecessors, (1375), 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-11 19:21:27,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:27,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 225 [2022-12-11 19:21:27,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:28,090 INFO L130 PetriNetUnfolder]: 781/6810 cut-off events. [2022-12-11 19:21:28,090 INFO L131 PetriNetUnfolder]: For 2134/2273 co-relation queries the response was YES. [2022-12-11 19:21:28,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10459 conditions, 6810 events. 781/6810 cut-off events. For 2134/2273 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 87530 event pairs, 217 based on Foata normal form. 4/6114 useless extension candidates. Maximal degree in co-relation 10404. Up to 797 conditions per place. [2022-12-11 19:21:28,160 INFO L137 encePairwiseOnDemand]: 213/225 looper letters, 33 selfloop transitions, 16 changer transitions 17/271 dead transitions. [2022-12-11 19:21:28,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 271 transitions, 1096 flow [2022-12-11 19:21:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:21:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:21:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1602 transitions. [2022-12-11 19:21:28,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.89 [2022-12-11 19:21:28,164 INFO L175 Difference]: Start difference. First operand has 259 places, 245 transitions, 866 flow. Second operand 8 states and 1602 transitions. [2022-12-11 19:21:28,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 271 transitions, 1096 flow [2022-12-11 19:21:28,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 271 transitions, 1078 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-11 19:21:28,190 INFO L231 Difference]: Finished difference. Result has 267 places, 248 transitions, 937 flow [2022-12-11 19:21:28,190 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=937, PETRI_PLACES=267, PETRI_TRANSITIONS=248} [2022-12-11 19:21:28,191 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 64 predicate places. [2022-12-11 19:21:28,191 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 248 transitions, 937 flow [2022-12-11 19:21:28,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.42857142857142) internal successors, (1375), 7 states have internal predecessors, (1375), 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-11 19:21:28,192 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:28,192 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:28,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 19:21:28,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1638758659, now seen corresponding path program 1 times [2022-12-11 19:21:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674688694] [2022-12-11 19:21:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:28,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:28,324 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-11 19:21:28,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:28,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674688694] [2022-12-11 19:21:28,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674688694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:28,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:28,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:21:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372921144] [2022-12-11 19:21:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:28,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:21:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:21:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:21:28,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 225 [2022-12-11 19:21:28,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 248 transitions, 937 flow. Second operand has 7 states, 7 states have (on average 200.28571428571428) internal successors, (1402), 7 states have internal predecessors, (1402), 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-11 19:21:28,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:28,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 225 [2022-12-11 19:21:28,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:28,879 INFO L130 PetriNetUnfolder]: 290/3807 cut-off events. [2022-12-11 19:21:28,879 INFO L131 PetriNetUnfolder]: For 1326/1507 co-relation queries the response was YES. [2022-12-11 19:21:28,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5831 conditions, 3807 events. 290/3807 cut-off events. For 1326/1507 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 46082 event pairs, 59 based on Foata normal form. 23/3478 useless extension candidates. Maximal degree in co-relation 5772. Up to 209 conditions per place. [2022-12-11 19:21:28,930 INFO L137 encePairwiseOnDemand]: 217/225 looper letters, 29 selfloop transitions, 5 changer transitions 16/273 dead transitions. [2022-12-11 19:21:28,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 273 transitions, 1163 flow [2022-12-11 19:21:28,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:21:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:21:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1821 transitions. [2022-12-11 19:21:28,935 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8992592592592593 [2022-12-11 19:21:28,935 INFO L175 Difference]: Start difference. First operand has 267 places, 248 transitions, 937 flow. Second operand 9 states and 1821 transitions. [2022-12-11 19:21:28,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 273 transitions, 1163 flow [2022-12-11 19:21:28,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 273 transitions, 1125 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-11 19:21:28,953 INFO L231 Difference]: Finished difference. Result has 274 places, 250 transitions, 947 flow [2022-12-11 19:21:28,954 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=947, PETRI_PLACES=274, PETRI_TRANSITIONS=250} [2022-12-11 19:21:28,956 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 71 predicate places. [2022-12-11 19:21:28,956 INFO L495 AbstractCegarLoop]: Abstraction has has 274 places, 250 transitions, 947 flow [2022-12-11 19:21:28,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 200.28571428571428) internal successors, (1402), 7 states have internal predecessors, (1402), 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-11 19:21:28,957 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:28,957 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:28,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 19:21:28,958 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:28,958 INFO L85 PathProgramCache]: Analyzing trace with hash -864877065, now seen corresponding path program 1 times [2022-12-11 19:21:28,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335618310] [2022-12-11 19:21:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:28,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:29,000 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-11 19:21:29,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:29,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335618310] [2022-12-11 19:21:29,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335618310] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:29,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:29,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:21:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629729568] [2022-12-11 19:21:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:29,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:21:29,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:21:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:21:29,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 225 [2022-12-11 19:21:29,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 250 transitions, 947 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-11 19:21:29,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:29,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 225 [2022-12-11 19:21:29,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:29,373 INFO L130 PetriNetUnfolder]: 211/3047 cut-off events. [2022-12-11 19:21:29,373 INFO L131 PetriNetUnfolder]: For 1058/1175 co-relation queries the response was YES. [2022-12-11 19:21:29,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4545 conditions, 3047 events. 211/3047 cut-off events. For 1058/1175 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 33924 event pairs, 13 based on Foata normal form. 13/2767 useless extension candidates. Maximal degree in co-relation 4506. Up to 123 conditions per place. [2022-12-11 19:21:29,407 INFO L137 encePairwiseOnDemand]: 219/225 looper letters, 18 selfloop transitions, 4 changer transitions 0/243 dead transitions. [2022-12-11 19:21:29,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 243 transitions, 919 flow [2022-12-11 19:21:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:21:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:21:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2022-12-11 19:21:29,409 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9348148148148148 [2022-12-11 19:21:29,409 INFO L175 Difference]: Start difference. First operand has 274 places, 250 transitions, 947 flow. Second operand 3 states and 631 transitions. [2022-12-11 19:21:29,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 243 transitions, 919 flow [2022-12-11 19:21:29,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 243 transitions, 886 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-12-11 19:21:29,422 INFO L231 Difference]: Finished difference. Result has 258 places, 241 transitions, 848 flow [2022-12-11 19:21:29,423 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=848, PETRI_PLACES=258, PETRI_TRANSITIONS=241} [2022-12-11 19:21:29,423 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 55 predicate places. [2022-12-11 19:21:29,423 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 241 transitions, 848 flow [2022-12-11 19:21:29,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-11 19:21:29,424 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:29,424 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:29,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 19:21:29,424 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:29,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash -198509045, now seen corresponding path program 1 times [2022-12-11 19:21:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:29,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962922166] [2022-12-11 19:21:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:29,465 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-11 19:21:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:29,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962922166] [2022-12-11 19:21:29,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962922166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:29,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:29,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:21:29,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362789556] [2022-12-11 19:21:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:29,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:21:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:29,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:21:29,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:21:29,468 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 225 [2022-12-11 19:21:29,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 241 transitions, 848 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-11 19:21:29,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:29,469 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 225 [2022-12-11 19:21:29,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:29,769 INFO L130 PetriNetUnfolder]: 194/2706 cut-off events. [2022-12-11 19:21:29,769 INFO L131 PetriNetUnfolder]: For 1574/1669 co-relation queries the response was YES. [2022-12-11 19:21:29,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2706 events. 194/2706 cut-off events. For 1574/1669 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 28123 event pairs, 39 based on Foata normal form. 40/2514 useless extension candidates. Maximal degree in co-relation 4308. Up to 144 conditions per place. [2022-12-11 19:21:29,798 INFO L137 encePairwiseOnDemand]: 221/225 looper letters, 26 selfloop transitions, 3 changer transitions 3/247 dead transitions. [2022-12-11 19:21:29,798 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 247 transitions, 940 flow [2022-12-11 19:21:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:21:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:21:29,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-12-11 19:21:29,800 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9377777777777778 [2022-12-11 19:21:29,800 INFO L175 Difference]: Start difference. First operand has 258 places, 241 transitions, 848 flow. Second operand 3 states and 633 transitions. [2022-12-11 19:21:29,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 247 transitions, 940 flow [2022-12-11 19:21:29,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 247 transitions, 932 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:29,814 INFO L231 Difference]: Finished difference. Result has 260 places, 242 transitions, 870 flow [2022-12-11 19:21:29,814 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=260, PETRI_TRANSITIONS=242} [2022-12-11 19:21:29,816 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 57 predicate places. [2022-12-11 19:21:29,817 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 242 transitions, 870 flow [2022-12-11 19:21:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-11 19:21:29,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:29,817 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 19:21:29,818 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:29,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1993872387, now seen corresponding path program 1 times [2022-12-11 19:21:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:29,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177200196] [2022-12-11 19:21:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:30,066 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-11 19:21:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:30,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177200196] [2022-12-11 19:21:30,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177200196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:30,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:30,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:21:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301927152] [2022-12-11 19:21:30,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:21:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:21:30,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:21:30,074 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 225 [2022-12-11 19:21:30,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 242 transitions, 870 flow. Second operand has 10 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 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-11 19:21:30,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:30,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 225 [2022-12-11 19:21:30,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:32,393 INFO L130 PetriNetUnfolder]: 2612/15396 cut-off events. [2022-12-11 19:21:32,393 INFO L131 PetriNetUnfolder]: For 7953/8743 co-relation queries the response was YES. [2022-12-11 19:21:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27671 conditions, 15396 events. 2612/15396 cut-off events. For 7953/8743 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 223758 event pairs, 717 based on Foata normal form. 256/14372 useless extension candidates. Maximal degree in co-relation 27639. Up to 1167 conditions per place. [2022-12-11 19:21:32,512 INFO L137 encePairwiseOnDemand]: 207/225 looper letters, 166 selfloop transitions, 48 changer transitions 30/448 dead transitions. [2022-12-11 19:21:32,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 448 transitions, 2324 flow [2022-12-11 19:21:32,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 19:21:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 19:21:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4441 transitions. [2022-12-11 19:21:32,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8581642512077294 [2022-12-11 19:21:32,521 INFO L175 Difference]: Start difference. First operand has 260 places, 242 transitions, 870 flow. Second operand 23 states and 4441 transitions. [2022-12-11 19:21:32,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 448 transitions, 2324 flow [2022-12-11 19:21:32,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 448 transitions, 2321 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-11 19:21:32,610 INFO L231 Difference]: Finished difference. Result has 294 places, 285 transitions, 1212 flow [2022-12-11 19:21:32,610 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1212, PETRI_PLACES=294, PETRI_TRANSITIONS=285} [2022-12-11 19:21:32,611 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 91 predicate places. [2022-12-11 19:21:32,612 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 285 transitions, 1212 flow [2022-12-11 19:21:32,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 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-11 19:21:32,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:32,613 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:32,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 19:21:32,613 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:32,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1757849035, now seen corresponding path program 2 times [2022-12-11 19:21:32,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:32,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846040957] [2022-12-11 19:21:32,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:32,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:32,854 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-11 19:21:32,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:32,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846040957] [2022-12-11 19:21:32,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846040957] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:32,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:32,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:21:32,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060958053] [2022-12-11 19:21:32,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:32,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:21:32,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:32,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:21:32,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:21:32,859 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 225 [2022-12-11 19:21:32,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 285 transitions, 1212 flow. Second operand has 9 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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-11 19:21:32,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:32,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 225 [2022-12-11 19:21:32,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:34,129 INFO L130 PetriNetUnfolder]: 668/7303 cut-off events. [2022-12-11 19:21:34,130 INFO L131 PetriNetUnfolder]: For 3792/4272 co-relation queries the response was YES. [2022-12-11 19:21:34,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12679 conditions, 7303 events. 668/7303 cut-off events. For 3792/4272 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 99810 event pairs, 151 based on Foata normal form. 37/6816 useless extension candidates. Maximal degree in co-relation 12634. Up to 545 conditions per place. [2022-12-11 19:21:34,363 INFO L137 encePairwiseOnDemand]: 212/225 looper letters, 80 selfloop transitions, 33 changer transitions 10/335 dead transitions. [2022-12-11 19:21:34,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 335 transitions, 1774 flow [2022-12-11 19:21:34,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:21:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:21:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2530 transitions. [2022-12-11 19:21:34,368 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.864957264957265 [2022-12-11 19:21:34,368 INFO L175 Difference]: Start difference. First operand has 294 places, 285 transitions, 1212 flow. Second operand 13 states and 2530 transitions. [2022-12-11 19:21:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 335 transitions, 1774 flow [2022-12-11 19:21:34,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 335 transitions, 1768 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:34,419 INFO L231 Difference]: Finished difference. Result has 311 places, 301 transitions, 1473 flow [2022-12-11 19:21:34,420 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1473, PETRI_PLACES=311, PETRI_TRANSITIONS=301} [2022-12-11 19:21:34,421 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 108 predicate places. [2022-12-11 19:21:34,421 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 301 transitions, 1473 flow [2022-12-11 19:21:34,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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-11 19:21:34,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:34,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:34,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 19:21:34,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:34,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1843246969, now seen corresponding path program 3 times [2022-12-11 19:21:34,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:34,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446582429] [2022-12-11 19:21:34,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:34,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:34,676 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-11 19:21:34,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:34,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446582429] [2022-12-11 19:21:34,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446582429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:34,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:34,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:21:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496751106] [2022-12-11 19:21:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:34,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:21:34,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:34,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:21:34,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:21:34,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 225 [2022-12-11 19:21:34,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 301 transitions, 1473 flow. Second operand has 9 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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-11 19:21:34,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:34,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 225 [2022-12-11 19:21:34,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:35,907 INFO L130 PetriNetUnfolder]: 666/7341 cut-off events. [2022-12-11 19:21:35,907 INFO L131 PetriNetUnfolder]: For 5041/5638 co-relation queries the response was YES. [2022-12-11 19:21:35,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13314 conditions, 7341 events. 666/7341 cut-off events. For 5041/5638 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 100624 event pairs, 143 based on Foata normal form. 38/6857 useless extension candidates. Maximal degree in co-relation 13261. Up to 540 conditions per place. [2022-12-11 19:21:35,995 INFO L137 encePairwiseOnDemand]: 213/225 looper letters, 81 selfloop transitions, 39 changer transitions 7/339 dead transitions. [2022-12-11 19:21:35,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 339 transitions, 1963 flow [2022-12-11 19:21:35,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:21:35,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:21:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2532 transitions. [2022-12-11 19:21:36,000 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8656410256410256 [2022-12-11 19:21:36,000 INFO L175 Difference]: Start difference. First operand has 311 places, 301 transitions, 1473 flow. Second operand 13 states and 2532 transitions. [2022-12-11 19:21:36,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 339 transitions, 1963 flow [2022-12-11 19:21:36,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 339 transitions, 1922 flow, removed 15 selfloop flow, removed 3 redundant places. [2022-12-11 19:21:36,048 INFO L231 Difference]: Finished difference. Result has 323 places, 308 transitions, 1624 flow [2022-12-11 19:21:36,048 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1624, PETRI_PLACES=323, PETRI_TRANSITIONS=308} [2022-12-11 19:21:36,049 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 120 predicate places. [2022-12-11 19:21:36,049 INFO L495 AbstractCegarLoop]: Abstraction has has 323 places, 308 transitions, 1624 flow [2022-12-11 19:21:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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-11 19:21:36,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:36,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:36,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 19:21:36,050 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:36,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash -954358449, now seen corresponding path program 4 times [2022-12-11 19:21:36,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:36,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086324031] [2022-12-11 19:21:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:36,267 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-11 19:21:36,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:36,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086324031] [2022-12-11 19:21:36,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086324031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:36,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:36,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:21:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264889975] [2022-12-11 19:21:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:21:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:36,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:21:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:21:36,274 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 225 [2022-12-11 19:21:36,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 308 transitions, 1624 flow. Second operand has 10 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 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-11 19:21:36,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:36,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 225 [2022-12-11 19:21:36,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:38,139 INFO L130 PetriNetUnfolder]: 2258/12019 cut-off events. [2022-12-11 19:21:38,139 INFO L131 PetriNetUnfolder]: For 13133/13780 co-relation queries the response was YES. [2022-12-11 19:21:38,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26787 conditions, 12019 events. 2258/12019 cut-off events. For 13133/13780 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 166557 event pairs, 595 based on Foata normal form. 204/11241 useless extension candidates. Maximal degree in co-relation 26731. Up to 1514 conditions per place. [2022-12-11 19:21:38,239 INFO L137 encePairwiseOnDemand]: 206/225 looper letters, 105 selfloop transitions, 49 changer transitions 16/374 dead transitions. [2022-12-11 19:21:38,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 374 transitions, 2374 flow [2022-12-11 19:21:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:21:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:21:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2321 transitions. [2022-12-11 19:21:38,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8596296296296296 [2022-12-11 19:21:38,243 INFO L175 Difference]: Start difference. First operand has 323 places, 308 transitions, 1624 flow. Second operand 12 states and 2321 transitions. [2022-12-11 19:21:38,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 374 transitions, 2374 flow [2022-12-11 19:21:38,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 374 transitions, 2343 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-11 19:21:38,357 INFO L231 Difference]: Finished difference. Result has 336 places, 317 transitions, 1872 flow [2022-12-11 19:21:38,357 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1872, PETRI_PLACES=336, PETRI_TRANSITIONS=317} [2022-12-11 19:21:38,358 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 133 predicate places. [2022-12-11 19:21:38,358 INFO L495 AbstractCegarLoop]: Abstraction has has 336 places, 317 transitions, 1872 flow [2022-12-11 19:21:38,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.5) internal successors, (1875), 10 states have internal predecessors, (1875), 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-11 19:21:38,359 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:38,359 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:38,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 19:21:38,359 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash 403636207, now seen corresponding path program 5 times [2022-12-11 19:21:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:38,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631867603] [2022-12-11 19:21:38,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:38,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:38,515 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-11 19:21:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:38,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631867603] [2022-12-11 19:21:38,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631867603] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:38,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:38,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:21:38,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315898713] [2022-12-11 19:21:38,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:21:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:38,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:21:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:21:38,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 225 [2022-12-11 19:21:38,523 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 317 transitions, 1872 flow. Second operand has 9 states, 9 states have (on average 187.77777777777777) internal successors, (1690), 9 states have internal predecessors, (1690), 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-11 19:21:38,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:38,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 225 [2022-12-11 19:21:38,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:40,706 INFO L130 PetriNetUnfolder]: 2536/13241 cut-off events. [2022-12-11 19:21:40,706 INFO L131 PetriNetUnfolder]: For 18869/19699 co-relation queries the response was YES. [2022-12-11 19:21:40,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31202 conditions, 13241 events. 2536/13241 cut-off events. For 18869/19699 co-relation queries the response was YES. Maximal size of possible extension queue 688. Compared 180305 event pairs, 1414 based on Foata normal form. 338/12439 useless extension candidates. Maximal degree in co-relation 31140. Up to 2539 conditions per place. [2022-12-11 19:21:40,826 INFO L137 encePairwiseOnDemand]: 206/225 looper letters, 143 selfloop transitions, 31 changer transitions 7/385 dead transitions. [2022-12-11 19:21:40,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 385 transitions, 2708 flow [2022-12-11 19:21:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 19:21:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 19:21:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2685 transitions. [2022-12-11 19:21:40,830 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8523809523809524 [2022-12-11 19:21:40,830 INFO L175 Difference]: Start difference. First operand has 336 places, 317 transitions, 1872 flow. Second operand 14 states and 2685 transitions. [2022-12-11 19:21:40,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 385 transitions, 2708 flow [2022-12-11 19:21:40,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 385 transitions, 2684 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:41,001 INFO L231 Difference]: Finished difference. Result has 356 places, 337 transitions, 2219 flow [2022-12-11 19:21:41,002 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2219, PETRI_PLACES=356, PETRI_TRANSITIONS=337} [2022-12-11 19:21:41,002 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 153 predicate places. [2022-12-11 19:21:41,002 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 337 transitions, 2219 flow [2022-12-11 19:21:41,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 187.77777777777777) internal successors, (1690), 9 states have internal predecessors, (1690), 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-11 19:21:41,003 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:41,003 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:41,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 19:21:41,004 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1553947077, now seen corresponding path program 6 times [2022-12-11 19:21:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:41,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323543944] [2022-12-11 19:21:41,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:41,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:41,163 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-11 19:21:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:41,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323543944] [2022-12-11 19:21:41,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323543944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:41,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:41,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:21:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614546275] [2022-12-11 19:21:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:41,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:21:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:21:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:21:41,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 225 [2022-12-11 19:21:41,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 337 transitions, 2219 flow. Second operand has 9 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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-11 19:21:41,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:41,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 225 [2022-12-11 19:21:41,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:42,606 INFO L130 PetriNetUnfolder]: 822/8331 cut-off events. [2022-12-11 19:21:42,606 INFO L131 PetriNetUnfolder]: For 13187/14245 co-relation queries the response was YES. [2022-12-11 19:21:42,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17991 conditions, 8331 events. 822/8331 cut-off events. For 13187/14245 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 112708 event pairs, 220 based on Foata normal form. 60/7810 useless extension candidates. Maximal degree in co-relation 17920. Up to 536 conditions per place. [2022-12-11 19:21:42,699 INFO L137 encePairwiseOnDemand]: 211/225 looper letters, 97 selfloop transitions, 35 changer transitions 28/376 dead transitions. [2022-12-11 19:21:42,699 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 376 transitions, 2790 flow [2022-12-11 19:21:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:21:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:21:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2150 transitions. [2022-12-11 19:21:42,702 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8686868686868687 [2022-12-11 19:21:42,702 INFO L175 Difference]: Start difference. First operand has 356 places, 337 transitions, 2219 flow. Second operand 11 states and 2150 transitions. [2022-12-11 19:21:42,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 376 transitions, 2790 flow [2022-12-11 19:21:42,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 376 transitions, 2734 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-12-11 19:21:42,785 INFO L231 Difference]: Finished difference. Result has 362 places, 320 transitions, 2054 flow [2022-12-11 19:21:42,785 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2054, PETRI_PLACES=362, PETRI_TRANSITIONS=320} [2022-12-11 19:21:42,786 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 159 predicate places. [2022-12-11 19:21:42,786 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 320 transitions, 2054 flow [2022-12-11 19:21:42,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 191.33333333333334) internal successors, (1722), 9 states have internal predecessors, (1722), 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-11 19:21:42,787 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:42,787 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 19:21:42,788 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1624650570, now seen corresponding path program 1 times [2022-12-11 19:21:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:42,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663581537] [2022-12-11 19:21:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:42,823 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-11 19:21:42,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:42,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663581537] [2022-12-11 19:21:42,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663581537] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:42,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:42,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:21:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491350938] [2022-12-11 19:21:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:42,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:21:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:21:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:21:42,826 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 225 [2022-12-11 19:21:42,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 320 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:42,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:42,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 225 [2022-12-11 19:21:42,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:44,214 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] thread2EXIT-->L79-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][311], [Black: 632#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0))) (<= |thread1Thread1of1ForFork0_#t~ite5#1| 0)), Black: 248#(<= ~result_9~0 0), Black: 614#true, Black: 626#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 382#(or (= |thread3Thread1of1ForFork2_#t~ite15#1| 1) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))), Black: 629#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (<= |thread1Thread1of1ForFork0_#t~ite5#1| 0)), Black: 639#(and (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), 661#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 384#(<= 1 ~result_11~0), Black: 624#(and (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 388#(and (<= 1 |thread3Thread1of1ForFork2_#t~ite15#1|) (or (= |thread3Thread1of1ForFork2_#t~ite15#1| 1) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))))), Black: 641#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 635#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), 244#true, 356#true, Black: 526#(and (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 528#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 530#(and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)), Black: 524#(and (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)))), Black: 514#(or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))), Black: 279#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0))), Black: 409#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite5#1| 1) 0)), 548#true, Black: 686#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 10#$Ultimate##0true, Black: 684#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 671#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 434#(not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))), 380#true, 616#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 512#true, Black: 297#(<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0), Black: 299#(<= (+ ~result_10~0 1) 0), Black: 303#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0)), Black: 309#(and (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0)), Black: 560#(and (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 305#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite10#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0)), Black: 562#(and (or (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 1))) (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 554#(<= ~result_9~0 0), Black: 322#true, Black: 329#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), Black: 332#true, Black: 586#(<= ~result_9~0 0), 437#true, Black: 344#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 598#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0)), Black: 340#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork2_#t~ite15#1|)), Black: 342#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork2_#t~ite15#1|) (<= 1 ~result_11~0)), Black: 591#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0)), Black: 596#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0)), 692#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 227#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 223#(<= ~result_9~0 0), Black: 442#(or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)), 334#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), Black: 479#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 443#(<= ~result_9~0 0), Black: 369#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1)), Black: 365#(and (or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))) (or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 1)) (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 0)))), Black: 359#(or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))), Black: 455#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0)), Black: 461#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 450#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 358#(or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 1)) (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 0))), Black: 489#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), 127#L79-2true, Black: 448#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 464#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 468#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 453#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0)), 580#true]) [2022-12-11 19:21:44,214 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 19:21:44,215 INFO L385 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-12-11 19:21:44,215 INFO L385 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-12-11 19:21:44,215 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 19:21:44,548 INFO L130 PetriNetUnfolder]: 695/10574 cut-off events. [2022-12-11 19:21:44,548 INFO L131 PetriNetUnfolder]: For 12889/14651 co-relation queries the response was YES. [2022-12-11 19:21:44,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20113 conditions, 10574 events. 695/10574 cut-off events. For 12889/14651 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 147794 event pairs, 229 based on Foata normal form. 39/9790 useless extension candidates. Maximal degree in co-relation 20042. Up to 595 conditions per place. [2022-12-11 19:21:44,659 INFO L137 encePairwiseOnDemand]: 219/225 looper letters, 17 selfloop transitions, 4 changer transitions 0/328 dead transitions. [2022-12-11 19:21:44,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 328 transitions, 2124 flow [2022-12-11 19:21:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:21:44,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:21:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-12-11 19:21:44,661 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9422222222222222 [2022-12-11 19:21:44,661 INFO L175 Difference]: Start difference. First operand has 362 places, 320 transitions, 2054 flow. Second operand 3 states and 636 transitions. [2022-12-11 19:21:44,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 328 transitions, 2124 flow [2022-12-11 19:21:44,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 328 transitions, 1981 flow, removed 15 selfloop flow, removed 14 redundant places. [2022-12-11 19:21:44,747 INFO L231 Difference]: Finished difference. Result has 347 places, 322 transitions, 1939 flow [2022-12-11 19:21:44,747 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1939, PETRI_PLACES=347, PETRI_TRANSITIONS=322} [2022-12-11 19:21:44,748 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 144 predicate places. [2022-12-11 19:21:44,748 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 322 transitions, 1939 flow [2022-12-11 19:21:44,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:44,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:44,749 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:44,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 19:21:44,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:44,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash 674061732, now seen corresponding path program 2 times [2022-12-11 19:21:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:44,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547350396] [2022-12-11 19:21:44,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:44,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:44,784 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-11 19:21:44,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:44,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547350396] [2022-12-11 19:21:44,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547350396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:44,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:44,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:21:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652299353] [2022-12-11 19:21:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:44,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:21:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:21:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:21:44,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 225 [2022-12-11 19:21:44,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 322 transitions, 1939 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:44,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:44,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 225 [2022-12-11 19:21:44,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:45,642 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([664] thread2EXIT-->L79-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem32#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][301], [Black: 632#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0))) (<= |thread1Thread1of1ForFork0_#t~ite5#1| 0)), Black: 614#true, Black: 248#(<= ~result_9~0 0), Black: 626#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 382#(or (= |thread3Thread1of1ForFork2_#t~ite15#1| 1) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))))), Black: 639#(and (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), 661#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), Black: 384#(<= 1 ~result_11~0), Black: 624#(and (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 388#(and (<= 1 |thread3Thread1of1ForFork2_#t~ite15#1|) (or (= |thread3Thread1of1ForFork2_#t~ite15#1| 1) (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))))), Black: 641#(and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), Black: 635#(and (<= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (or (<= ~result_10~0 0) (<= ~result_9~0 0) (not (<= ~result_11~0 0)))), 244#true, 356#true, Black: 526#(and (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 528#(and (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 530#(and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)), Black: 524#(and (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)))), Black: 514#(or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))), 695#true, Black: 279#(and (<= ~result_9~0 0) (or (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0))), Black: 409#(and (<= (+ |thread1Thread1of1ForFork0_#t~ite4#1| 1) 0) (<= (+ |thread1Thread1of1ForFork0_#t~ite5#1| 1) 0)), 548#true, 10#$Ultimate##0true, Black: 671#(and (<= ~result_9~0 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))), Black: 434#(not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))), Black: 690#true, 616#(not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))), 380#true, 512#true, Black: 297#(<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0), Black: 299#(<= (+ ~result_10~0 1) 0), Black: 303#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite10#1| 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0)), Black: 309#(and (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0)), Black: 560#(and (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 305#(and (<= (+ |thread2Thread1of1ForFork1_#t~ite10#1| 1) 0) (<= (+ ~result_10~0 1) 0) (<= (+ |thread2Thread1of1ForFork1_#t~ite9#1| 1) 0)), Black: 562#(and (or (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 1))) (<= ~result_9~0 0) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 1)) (and (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256)))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0))) (or (and (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 1)) (and (= |thread1Thread1of1ForFork0_#t~ite4#1| 0) (not (= ~filename_5~0 (* 256 (div ~filename_5~0 256))))))), Black: 322#true, Black: 329#(not (= (* (div ~isNull_0~0 256) 256) ~isNull_0~0)), Black: 332#true, 437#true, Black: 344#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 ~result_11~0)), Black: 340#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork2_#t~ite15#1|)), Black: 342#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (<= 1 |thread3Thread1of1ForFork2_#t~ite15#1|) (<= 1 ~result_11~0)), Black: 591#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0)), Black: 596#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0) (<= |thread1Thread1of1ForFork0_#t~ite3#1| 0)), 692#(= ~filename_2~0 (* 256 (div ~filename_2~0 256))), Black: 227#(and (<= ~result_9~0 0) (not (= ~isNull_3~0 (* 256 (div ~isNull_3~0 256))))), Black: 223#(<= ~result_9~0 0), Black: 442#(or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0)), Black: 479#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), 334#(= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))), Black: 443#(<= ~result_9~0 0), Black: 369#(and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1)), Black: 365#(and (or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))) (or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 1)) (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 0)))), Black: 359#(or (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= ~result_11~0 0)) (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= ~result_11~0 1))), Black: 455#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0)), Black: 461#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 450#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 489#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite5#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 358#(or (and (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 1)) (and (not (= ~isNull_6~0 (* 256 (div ~isNull_6~0 256)))) (= |thread3Thread1of1ForFork2_#t~ite15#1| 0))), 127#L79-2true, Black: 448#(and (<= ~result_9~0 0) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 464#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite4#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 468#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= ~result_9~0 0))), Black: 453#(and (or (= ~filename_5~0 (* 256 (div ~filename_5~0 256))) (= |thread1Thread1of1ForFork0_#t~ite3#1| 0)) (<= ~result_9~0 0))]) [2022-12-11 19:21:45,643 INFO L382 tUnfolder$Statistics]: this new event has 114 ancestors and is cut-off event [2022-12-11 19:21:45,643 INFO L385 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-12-11 19:21:45,643 INFO L385 tUnfolder$Statistics]: existing Event has 98 ancestors and is cut-off event [2022-12-11 19:21:45,643 INFO L385 tUnfolder$Statistics]: existing Event has 100 ancestors and is cut-off event [2022-12-11 19:21:45,990 INFO L130 PetriNetUnfolder]: 492/8388 cut-off events. [2022-12-11 19:21:45,990 INFO L131 PetriNetUnfolder]: For 8955/10161 co-relation queries the response was YES. [2022-12-11 19:21:46,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15490 conditions, 8388 events. 492/8388 cut-off events. For 8955/10161 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 109750 event pairs, 228 based on Foata normal form. 75/7873 useless extension candidates. Maximal degree in co-relation 15424. Up to 461 conditions per place. [2022-12-11 19:21:46,054 INFO L137 encePairwiseOnDemand]: 221/225 looper letters, 21 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2022-12-11 19:21:46,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 330 transitions, 2017 flow [2022-12-11 19:21:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:21:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:21:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-12-11 19:21:46,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9422222222222222 [2022-12-11 19:21:46,056 INFO L175 Difference]: Start difference. First operand has 347 places, 322 transitions, 1939 flow. Second operand 3 states and 636 transitions. [2022-12-11 19:21:46,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 330 transitions, 2017 flow [2022-12-11 19:21:46,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 330 transitions, 2009 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:21:46,117 INFO L231 Difference]: Finished difference. Result has 349 places, 324 transitions, 1955 flow [2022-12-11 19:21:46,117 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1955, PETRI_PLACES=349, PETRI_TRANSITIONS=324} [2022-12-11 19:21:46,117 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 146 predicate places. [2022-12-11 19:21:46,118 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 324 transitions, 1955 flow [2022-12-11 19:21:46,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-11 19:21:46,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:46,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:46,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-11 19:21:46,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1102957826, now seen corresponding path program 1 times [2022-12-11 19:21:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:46,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847265570] [2022-12-11 19:21:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:46,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:46,256 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-11 19:21:46,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:46,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847265570] [2022-12-11 19:21:46,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847265570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:46,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:46,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:21:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643920] [2022-12-11 19:21:46,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:46,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:21:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:21:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:21:46,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 225 [2022-12-11 19:21:46,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 324 transitions, 1955 flow. Second operand has 9 states, 9 states have (on average 190.66666666666666) internal successors, (1716), 9 states have internal predecessors, (1716), 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-11 19:21:46,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:46,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 225 [2022-12-11 19:21:46,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:50,765 INFO L130 PetriNetUnfolder]: 6653/26312 cut-off events. [2022-12-11 19:21:50,766 INFO L131 PetriNetUnfolder]: For 104740/110721 co-relation queries the response was YES. [2022-12-11 19:21:50,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76850 conditions, 26312 events. 6653/26312 cut-off events. For 104740/110721 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 376411 event pairs, 2611 based on Foata normal form. 1161/26205 useless extension candidates. Maximal degree in co-relation 76783. Up to 7123 conditions per place. [2022-12-11 19:21:51,031 INFO L137 encePairwiseOnDemand]: 208/225 looper letters, 103 selfloop transitions, 69 changer transitions 65/500 dead transitions. [2022-12-11 19:21:51,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 500 transitions, 4722 flow [2022-12-11 19:21:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:21:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:21:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3302 transitions. [2022-12-11 19:21:51,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8632679738562091 [2022-12-11 19:21:51,035 INFO L175 Difference]: Start difference. First operand has 349 places, 324 transitions, 1955 flow. Second operand 17 states and 3302 transitions. [2022-12-11 19:21:51,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 500 transitions, 4722 flow [2022-12-11 19:21:51,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 500 transitions, 4716 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-11 19:21:51,361 INFO L231 Difference]: Finished difference. Result has 377 places, 371 transitions, 3014 flow [2022-12-11 19:21:51,362 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3014, PETRI_PLACES=377, PETRI_TRANSITIONS=371} [2022-12-11 19:21:51,362 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 174 predicate places. [2022-12-11 19:21:51,362 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 371 transitions, 3014 flow [2022-12-11 19:21:51,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.66666666666666) internal successors, (1716), 9 states have internal predecessors, (1716), 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-11 19:21:51,363 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:51,363 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-11 19:21:51,363 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash -631527258, now seen corresponding path program 2 times [2022-12-11 19:21:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:51,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656209323] [2022-12-11 19:21:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:51,643 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-11 19:21:51,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:51,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656209323] [2022-12-11 19:21:51,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656209323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:51,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:51,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:21:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351009637] [2022-12-11 19:21:51,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:51,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:21:51,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:51,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:21:51,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:21:51,646 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 225 [2022-12-11 19:21:51,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 371 transitions, 3014 flow. Second operand has 10 states, 10 states have (on average 190.4) internal successors, (1904), 10 states have internal predecessors, (1904), 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-11 19:21:51,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:51,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 225 [2022-12-11 19:21:51,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:21:56,215 INFO L130 PetriNetUnfolder]: 5782/23444 cut-off events. [2022-12-11 19:21:56,216 INFO L131 PetriNetUnfolder]: For 248437/263681 co-relation queries the response was YES. [2022-12-11 19:21:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90928 conditions, 23444 events. 5782/23444 cut-off events. For 248437/263681 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 329427 event pairs, 2467 based on Foata normal form. 1313/23618 useless extension candidates. Maximal degree in co-relation 90848. Up to 5430 conditions per place. [2022-12-11 19:21:56,453 INFO L137 encePairwiseOnDemand]: 210/225 looper letters, 111 selfloop transitions, 22 changer transitions 127/509 dead transitions. [2022-12-11 19:21:56,453 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 509 transitions, 6497 flow [2022-12-11 19:21:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 19:21:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 19:21:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3484 transitions. [2022-12-11 19:21:56,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.860246913580247 [2022-12-11 19:21:56,457 INFO L175 Difference]: Start difference. First operand has 377 places, 371 transitions, 3014 flow. Second operand 18 states and 3484 transitions. [2022-12-11 19:21:56,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 509 transitions, 6497 flow [2022-12-11 19:21:57,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 509 transitions, 6245 flow, removed 97 selfloop flow, removed 12 redundant places. [2022-12-11 19:21:57,687 INFO L231 Difference]: Finished difference. Result has 377 places, 334 transitions, 2326 flow [2022-12-11 19:21:57,688 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2859, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2326, PETRI_PLACES=377, PETRI_TRANSITIONS=334} [2022-12-11 19:21:57,688 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 174 predicate places. [2022-12-11 19:21:57,688 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 334 transitions, 2326 flow [2022-12-11 19:21:57,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 190.4) internal successors, (1904), 10 states have internal predecessors, (1904), 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-11 19:21:57,689 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:21:57,689 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:21:57,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-11 19:21:57,689 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:21:57,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:21:57,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1689566299, now seen corresponding path program 1 times [2022-12-11 19:21:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:21:57,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545869657] [2022-12-11 19:21:57,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:21:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:21:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:21:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:21:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:21:57,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545869657] [2022-12-11 19:21:57,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545869657] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:21:57,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:21:57,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:21:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552956629] [2022-12-11 19:21:57,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:21:57,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:21:57,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:21:57,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:21:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:21:57,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 225 [2022-12-11 19:21:57,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 334 transitions, 2326 flow. Second operand has 10 states, 10 states have (on average 190.4) internal successors, (1904), 10 states have internal predecessors, (1904), 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-11 19:21:57,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:21:57,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 225 [2022-12-11 19:21:57,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:22:01,848 INFO L130 PetriNetUnfolder]: 4764/23448 cut-off events. [2022-12-11 19:22:01,849 INFO L131 PetriNetUnfolder]: For 106813/111684 co-relation queries the response was YES. [2022-12-11 19:22:02,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73598 conditions, 23448 events. 4764/23448 cut-off events. For 106813/111684 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 341756 event pairs, 3079 based on Foata normal form. 644/22229 useless extension candidates. Maximal degree in co-relation 73525. Up to 6805 conditions per place. [2022-12-11 19:22:02,059 INFO L137 encePairwiseOnDemand]: 210/225 looper letters, 158 selfloop transitions, 17 changer transitions 72/481 dead transitions. [2022-12-11 19:22:02,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 481 transitions, 4014 flow [2022-12-11 19:22:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 19:22:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 19:22:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2903 transitions. [2022-12-11 19:22:02,062 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8601481481481481 [2022-12-11 19:22:02,062 INFO L175 Difference]: Start difference. First operand has 377 places, 334 transitions, 2326 flow. Second operand 15 states and 2903 transitions. [2022-12-11 19:22:02,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 481 transitions, 4014 flow [2022-12-11 19:22:02,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 481 transitions, 3765 flow, removed 93 selfloop flow, removed 16 redundant places. [2022-12-11 19:22:02,592 INFO L231 Difference]: Finished difference. Result has 372 places, 335 transitions, 2304 flow [2022-12-11 19:22:02,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2304, PETRI_PLACES=372, PETRI_TRANSITIONS=335} [2022-12-11 19:22:02,593 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 169 predicate places. [2022-12-11 19:22:02,593 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 335 transitions, 2304 flow [2022-12-11 19:22:02,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 190.4) internal successors, (1904), 10 states have internal predecessors, (1904), 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-11 19:22:02,594 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:22:02,594 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:22:02,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-11 19:22:02,594 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:22:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:22:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 892382100, now seen corresponding path program 1 times [2022-12-11 19:22:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:22:02,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359871152] [2022-12-11 19:22:02,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:22:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:22:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:22:02,783 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-11 19:22:02,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:22:02,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359871152] [2022-12-11 19:22:02,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359871152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:22:02,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:22:02,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:22:02,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449043288] [2022-12-11 19:22:02,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:22:02,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:22:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:22:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:22:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:22:02,786 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 225 [2022-12-11 19:22:02,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 335 transitions, 2304 flow. Second operand has 9 states, 9 states have (on average 190.33333333333334) internal successors, (1713), 9 states have internal predecessors, (1713), 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-11 19:22:02,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:22:02,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 225 [2022-12-11 19:22:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:22:10,845 INFO L130 PetriNetUnfolder]: 7471/46468 cut-off events. [2022-12-11 19:22:10,845 INFO L131 PetriNetUnfolder]: For 107284/114071 co-relation queries the response was YES. [2022-12-11 19:22:11,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106494 conditions, 46468 events. 7471/46468 cut-off events. For 107284/114071 co-relation queries the response was YES. Maximal size of possible extension queue 2037. Compared 777881 event pairs, 2116 based on Foata normal form. 1176/44084 useless extension candidates. Maximal degree in co-relation 106418. Up to 5361 conditions per place. [2022-12-11 19:22:11,598 INFO L137 encePairwiseOnDemand]: 209/225 looper letters, 87 selfloop transitions, 54 changer transitions 13/452 dead transitions. [2022-12-11 19:22:11,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 452 transitions, 3029 flow [2022-12-11 19:22:11,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 19:22:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 19:22:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3894 transitions. [2022-12-11 19:22:11,608 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8653333333333333 [2022-12-11 19:22:11,608 INFO L175 Difference]: Start difference. First operand has 372 places, 335 transitions, 2304 flow. Second operand 20 states and 3894 transitions. [2022-12-11 19:22:11,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 452 transitions, 3029 flow [2022-12-11 19:22:12,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 452 transitions, 2984 flow, removed 18 selfloop flow, removed 7 redundant places. [2022-12-11 19:22:12,425 INFO L231 Difference]: Finished difference. Result has 385 places, 397 transitions, 2728 flow [2022-12-11 19:22:12,425 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2265, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2728, PETRI_PLACES=385, PETRI_TRANSITIONS=397} [2022-12-11 19:22:12,426 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 182 predicate places. [2022-12-11 19:22:12,426 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 397 transitions, 2728 flow [2022-12-11 19:22:12,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.33333333333334) internal successors, (1713), 9 states have internal predecessors, (1713), 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-11 19:22:12,426 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:22:12,427 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:22:12,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-11 19:22:12,428 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:22:12,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:22:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash 865124530, now seen corresponding path program 2 times [2022-12-11 19:22:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:22:12,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563069518] [2022-12-11 19:22:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:22:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:22:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:22:12,688 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-11 19:22:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:22:12,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563069518] [2022-12-11 19:22:12,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563069518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:22:12,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:22:12,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:22:12,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880925326] [2022-12-11 19:22:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:22:12,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:22:12,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:22:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:22:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:22:12,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2022-12-11 19:22:12,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 397 transitions, 2728 flow. Second operand has 9 states, 9 states have (on average 186.77777777777777) internal successors, (1681), 9 states have internal predecessors, (1681), 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-11 19:22:12,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:22:12,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2022-12-11 19:22:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:22:26,661 INFO L130 PetriNetUnfolder]: 14041/72550 cut-off events. [2022-12-11 19:22:26,661 INFO L131 PetriNetUnfolder]: For 371840/394330 co-relation queries the response was YES. [2022-12-11 19:22:27,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200226 conditions, 72550 events. 14041/72550 cut-off events. For 371840/394330 co-relation queries the response was YES. Maximal size of possible extension queue 2891. Compared 1243998 event pairs, 6684 based on Foata normal form. 4000/71776 useless extension candidates. Maximal degree in co-relation 200148. Up to 15412 conditions per place. [2022-12-11 19:22:28,021 INFO L137 encePairwiseOnDemand]: 205/225 looper letters, 157 selfloop transitions, 39 changer transitions 43/498 dead transitions. [2022-12-11 19:22:28,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 498 transitions, 4679 flow [2022-12-11 19:22:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:22:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:22:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2488 transitions. [2022-12-11 19:22:28,024 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8505982905982906 [2022-12-11 19:22:28,024 INFO L175 Difference]: Start difference. First operand has 385 places, 397 transitions, 2728 flow. Second operand 13 states and 2488 transitions. [2022-12-11 19:22:28,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 498 transitions, 4679 flow [2022-12-11 19:22:30,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 498 transitions, 4641 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-11 19:22:30,023 INFO L231 Difference]: Finished difference. Result has 404 places, 402 transitions, 2907 flow [2022-12-11 19:22:30,024 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2907, PETRI_PLACES=404, PETRI_TRANSITIONS=402} [2022-12-11 19:22:30,024 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 201 predicate places. [2022-12-11 19:22:30,024 INFO L495 AbstractCegarLoop]: Abstraction has has 404 places, 402 transitions, 2907 flow [2022-12-11 19:22:30,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 186.77777777777777) internal successors, (1681), 9 states have internal predecessors, (1681), 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-11 19:22:30,025 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:22:30,025 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:22:30,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-11 19:22:30,025 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:22:30,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:22:30,026 INFO L85 PathProgramCache]: Analyzing trace with hash -233273676, now seen corresponding path program 3 times [2022-12-11 19:22:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:22:30,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954442609] [2022-12-11 19:22:30,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:22:30,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:22:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:22:30,183 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-11 19:22:30,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:22:30,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954442609] [2022-12-11 19:22:30,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954442609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:22:30,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:22:30,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:22:30,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534690841] [2022-12-11 19:22:30,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:22:30,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:22:30,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:22:30,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:22:30,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:22:30,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2022-12-11 19:22:30,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 402 transitions, 2907 flow. Second operand has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:22:30,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:22:30,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2022-12-11 19:22:30,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:22:43,048 INFO L130 PetriNetUnfolder]: 12916/69326 cut-off events. [2022-12-11 19:22:43,048 INFO L131 PetriNetUnfolder]: For 416926/439386 co-relation queries the response was YES. [2022-12-11 19:22:44,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198954 conditions, 69326 events. 12916/69326 cut-off events. For 416926/439386 co-relation queries the response was YES. Maximal size of possible extension queue 2649. Compared 1183652 event pairs, 5952 based on Foata normal form. 4105/68944 useless extension candidates. Maximal degree in co-relation 198867. Up to 14185 conditions per place. [2022-12-11 19:22:44,457 INFO L137 encePairwiseOnDemand]: 209/225 looper letters, 145 selfloop transitions, 27 changer transitions 48/475 dead transitions. [2022-12-11 19:22:44,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 475 transitions, 4608 flow [2022-12-11 19:22:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:22:44,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:22:44,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2483 transitions. [2022-12-11 19:22:44,460 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8488888888888889 [2022-12-11 19:22:44,460 INFO L175 Difference]: Start difference. First operand has 404 places, 402 transitions, 2907 flow. Second operand 13 states and 2483 transitions. [2022-12-11 19:22:44,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 475 transitions, 4608 flow [2022-12-11 19:22:46,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 475 transitions, 4437 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-11 19:22:46,643 INFO L231 Difference]: Finished difference. Result has 406 places, 390 transitions, 2586 flow [2022-12-11 19:22:46,644 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2780, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2586, PETRI_PLACES=406, PETRI_TRANSITIONS=390} [2022-12-11 19:22:46,644 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 203 predicate places. [2022-12-11 19:22:46,644 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 390 transitions, 2586 flow [2022-12-11 19:22:46,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:22:46,645 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:22:46,645 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:22:46,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-11 19:22:46,645 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:22:46,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:22:46,646 INFO L85 PathProgramCache]: Analyzing trace with hash -184200962, now seen corresponding path program 4 times [2022-12-11 19:22:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:22:46,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836242046] [2022-12-11 19:22:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:22:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:22:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:22:46,877 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-11 19:22:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:22:46,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836242046] [2022-12-11 19:22:46,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836242046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:22:46,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:22:46,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 19:22:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316065144] [2022-12-11 19:22:46,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:22:46,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 19:22:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:22:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 19:22:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-11 19:22:46,880 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2022-12-11 19:22:46,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 390 transitions, 2586 flow. Second operand has 9 states, 9 states have (on average 186.77777777777777) internal successors, (1681), 9 states have internal predecessors, (1681), 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-11 19:22:46,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:22:46,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2022-12-11 19:22:46,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:22:59,687 INFO L130 PetriNetUnfolder]: 12873/64647 cut-off events. [2022-12-11 19:22:59,688 INFO L131 PetriNetUnfolder]: For 384826/407655 co-relation queries the response was YES. [2022-12-11 19:23:01,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197333 conditions, 64647 events. 12873/64647 cut-off events. For 384826/407655 co-relation queries the response was YES. Maximal size of possible extension queue 2605. Compared 1081021 event pairs, 4896 based on Foata normal form. 3531/64707 useless extension candidates. Maximal degree in co-relation 197245. Up to 13277 conditions per place. [2022-12-11 19:23:01,762 INFO L137 encePairwiseOnDemand]: 205/225 looper letters, 174 selfloop transitions, 65 changer transitions 70/564 dead transitions. [2022-12-11 19:23:01,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 564 transitions, 6714 flow [2022-12-11 19:23:01,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:23:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:23:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3260 transitions. [2022-12-11 19:23:01,785 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8522875816993464 [2022-12-11 19:23:01,785 INFO L175 Difference]: Start difference. First operand has 406 places, 390 transitions, 2586 flow. Second operand 17 states and 3260 transitions. [2022-12-11 19:23:01,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 564 transitions, 6714 flow [2022-12-11 19:23:04,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 564 transitions, 6661 flow, removed 8 selfloop flow, removed 9 redundant places. [2022-12-11 19:23:04,341 INFO L231 Difference]: Finished difference. Result has 414 places, 407 transitions, 3164 flow [2022-12-11 19:23:04,341 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2537, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3164, PETRI_PLACES=414, PETRI_TRANSITIONS=407} [2022-12-11 19:23:04,341 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 211 predicate places. [2022-12-11 19:23:04,341 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 407 transitions, 3164 flow [2022-12-11 19:23:04,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 186.77777777777777) internal successors, (1681), 9 states have internal predecessors, (1681), 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-11 19:23:04,342 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:23:04,342 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:23:04,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-11 19:23:04,342 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:23:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:23:04,343 INFO L85 PathProgramCache]: Analyzing trace with hash 646674476, now seen corresponding path program 5 times [2022-12-11 19:23:04,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:23:04,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780733533] [2022-12-11 19:23:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:23:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:23:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:23:04,517 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-11 19:23:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:23:04,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780733533] [2022-12-11 19:23:04,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780733533] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:23:04,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:23:04,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:23:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526934087] [2022-12-11 19:23:04,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:23:04,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:23:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:23:04,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:23:04,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:23:04,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2022-12-11 19:23:04,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 407 transitions, 3164 flow. Second operand has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:23:04,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:23:04,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2022-12-11 19:23:04,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:23:17,603 INFO L130 PetriNetUnfolder]: 13254/66295 cut-off events. [2022-12-11 19:23:17,603 INFO L131 PetriNetUnfolder]: For 552354/578644 co-relation queries the response was YES. [2022-12-11 19:23:18,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219267 conditions, 66295 events. 13254/66295 cut-off events. For 552354/578644 co-relation queries the response was YES. Maximal size of possible extension queue 2754. Compared 1113619 event pairs, 5817 based on Foata normal form. 3502/65740 useless extension candidates. Maximal degree in co-relation 219178. Up to 15376 conditions per place. [2022-12-11 19:23:19,011 INFO L137 encePairwiseOnDemand]: 207/225 looper letters, 160 selfloop transitions, 35 changer transitions 38/488 dead transitions. [2022-12-11 19:23:19,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 488 transitions, 5342 flow [2022-12-11 19:23:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 19:23:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 19:23:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2487 transitions. [2022-12-11 19:23:19,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8502564102564103 [2022-12-11 19:23:19,014 INFO L175 Difference]: Start difference. First operand has 414 places, 407 transitions, 3164 flow. Second operand 13 states and 2487 transitions. [2022-12-11 19:23:19,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 488 transitions, 5342 flow [2022-12-11 19:23:21,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 488 transitions, 5138 flow, removed 93 selfloop flow, removed 7 redundant places. [2022-12-11 19:23:21,961 INFO L231 Difference]: Finished difference. Result has 425 places, 414 transitions, 3153 flow [2022-12-11 19:23:21,961 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2962, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3153, PETRI_PLACES=425, PETRI_TRANSITIONS=414} [2022-12-11 19:23:21,961 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 222 predicate places. [2022-12-11 19:23:21,961 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 414 transitions, 3153 flow [2022-12-11 19:23:21,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:23:21,962 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:23:21,962 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:23:21,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-11 19:23:21,962 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:23:21,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:23:21,963 INFO L85 PathProgramCache]: Analyzing trace with hash 695740200, now seen corresponding path program 6 times [2022-12-11 19:23:21,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:23:21,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699315727] [2022-12-11 19:23:21,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:23:21,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:23:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:23:22,170 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-11 19:23:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:23:22,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699315727] [2022-12-11 19:23:22,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699315727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:23:22,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:23:22,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:23:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411981947] [2022-12-11 19:23:22,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:23:22,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:23:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:23:22,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:23:22,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:23:22,173 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2022-12-11 19:23:22,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 414 transitions, 3153 flow. Second operand has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:23:22,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:23:22,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2022-12-11 19:23:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:23:36,977 INFO L130 PetriNetUnfolder]: 13464/67907 cut-off events. [2022-12-11 19:23:36,977 INFO L131 PetriNetUnfolder]: For 532784/559848 co-relation queries the response was YES. [2022-12-11 19:23:38,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226855 conditions, 67907 events. 13464/67907 cut-off events. For 532784/559848 co-relation queries the response was YES. Maximal size of possible extension queue 2852. Compared 1147302 event pairs, 5554 based on Foata normal form. 3728/67790 useless extension candidates. Maximal degree in co-relation 226759. Up to 14570 conditions per place. [2022-12-11 19:23:39,020 INFO L137 encePairwiseOnDemand]: 207/225 looper letters, 174 selfloop transitions, 50 changer transitions 54/533 dead transitions. [2022-12-11 19:23:39,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 533 transitions, 6291 flow [2022-12-11 19:23:39,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 19:23:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 19:23:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2871 transitions. [2022-12-11 19:23:39,023 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8506666666666667 [2022-12-11 19:23:39,023 INFO L175 Difference]: Start difference. First operand has 425 places, 414 transitions, 3153 flow. Second operand 15 states and 2871 transitions. [2022-12-11 19:23:39,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 533 transitions, 6291 flow [2022-12-11 19:23:42,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 533 transitions, 6261 flow, removed 14 selfloop flow, removed 3 redundant places. [2022-12-11 19:23:42,226 INFO L231 Difference]: Finished difference. Result has 440 places, 420 transitions, 3340 flow [2022-12-11 19:23:42,227 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=3127, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3340, PETRI_PLACES=440, PETRI_TRANSITIONS=420} [2022-12-11 19:23:42,227 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 237 predicate places. [2022-12-11 19:23:42,227 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 420 transitions, 3340 flow [2022-12-11 19:23:42,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:23:42,228 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:23:42,228 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:23:42,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-11 19:23:42,228 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:23:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:23:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1662449316, now seen corresponding path program 7 times [2022-12-11 19:23:42,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:23:42,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109249198] [2022-12-11 19:23:42,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:23:42,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:23:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:23:42,409 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-11 19:23:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:23:42,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109249198] [2022-12-11 19:23:42,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109249198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:23:42,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:23:42,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:23:42,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532208357] [2022-12-11 19:23:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:23:42,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:23:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:23:42,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:23:42,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:23:42,412 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 225 [2022-12-11 19:23:42,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 420 transitions, 3340 flow. Second operand has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:23:42,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:23:42,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 225 [2022-12-11 19:23:42,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:23:57,115 INFO L130 PetriNetUnfolder]: 13469/68216 cut-off events. [2022-12-11 19:23:57,116 INFO L131 PetriNetUnfolder]: For 547215/571411 co-relation queries the response was YES. [2022-12-11 19:23:58,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233267 conditions, 68216 events. 13469/68216 cut-off events. For 547215/571411 co-relation queries the response was YES. Maximal size of possible extension queue 2840. Compared 1153178 event pairs, 5019 based on Foata normal form. 4123/68699 useless extension candidates. Maximal degree in co-relation 233166. Up to 13410 conditions per place. [2022-12-11 19:23:58,859 INFO L137 encePairwiseOnDemand]: 207/225 looper letters, 160 selfloop transitions, 64 changer transitions 126/589 dead transitions. [2022-12-11 19:23:58,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 589 transitions, 7736 flow [2022-12-11 19:23:58,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-11 19:23:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-11 19:23:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3444 transitions. [2022-12-11 19:23:58,862 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8503703703703703 [2022-12-11 19:23:58,863 INFO L175 Difference]: Start difference. First operand has 440 places, 420 transitions, 3340 flow. Second operand 18 states and 3444 transitions. [2022-12-11 19:23:58,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 589 transitions, 7736 flow [2022-12-11 19:24:02,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 589 transitions, 7694 flow, removed 16 selfloop flow, removed 5 redundant places. [2022-12-11 19:24:02,273 INFO L231 Difference]: Finished difference. Result has 453 places, 393 transitions, 2945 flow [2022-12-11 19:24:02,273 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=3300, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2945, PETRI_PLACES=453, PETRI_TRANSITIONS=393} [2022-12-11 19:24:02,273 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 250 predicate places. [2022-12-11 19:24:02,274 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 393 transitions, 2945 flow [2022-12-11 19:24:02,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.5) internal successors, (1865), 10 states have internal predecessors, (1865), 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-11 19:24:02,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:24:02,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:24:02,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-11 19:24:02,275 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:24:02,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:24:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2022267883, now seen corresponding path program 1 times [2022-12-11 19:24:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:24:02,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660891828] [2022-12-11 19:24:02,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:24:02,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:24:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:24:02,312 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-11 19:24:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:24:02,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660891828] [2022-12-11 19:24:02,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660891828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:24:02,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:24:02,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:24:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171559504] [2022-12-11 19:24:02,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:24:02,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:24:02,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:24:02,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:24:02,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:24:02,314 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 225 [2022-12-11 19:24:02,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 393 transitions, 2945 flow. Second operand has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-11 19:24:02,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:24:02,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 225 [2022-12-11 19:24:02,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:24:06,480 INFO L130 PetriNetUnfolder]: 1598/23067 cut-off events. [2022-12-11 19:24:06,480 INFO L131 PetriNetUnfolder]: For 84725/88720 co-relation queries the response was YES. [2022-12-11 19:24:06,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65684 conditions, 23067 events. 1598/23067 cut-off events. For 84725/88720 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 362687 event pairs, 469 based on Foata normal form. 314/22276 useless extension candidates. Maximal degree in co-relation 65581. Up to 2103 conditions per place. [2022-12-11 19:24:06,726 INFO L137 encePairwiseOnDemand]: 219/225 looper letters, 20 selfloop transitions, 4 changer transitions 15/386 dead transitions. [2022-12-11 19:24:06,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 386 transitions, 2807 flow [2022-12-11 19:24:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:24:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:24:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2022-12-11 19:24:06,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9407407407407408 [2022-12-11 19:24:06,727 INFO L175 Difference]: Start difference. First operand has 453 places, 393 transitions, 2945 flow. Second operand 3 states and 635 transitions. [2022-12-11 19:24:06,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 386 transitions, 2807 flow [2022-12-11 19:24:07,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 386 transitions, 2615 flow, removed 34 selfloop flow, removed 26 redundant places. [2022-12-11 19:24:07,382 INFO L231 Difference]: Finished difference. Result has 420 places, 368 transitions, 2431 flow [2022-12-11 19:24:07,382 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2518, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2431, PETRI_PLACES=420, PETRI_TRANSITIONS=368} [2022-12-11 19:24:07,382 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 217 predicate places. [2022-12-11 19:24:07,383 INFO L495 AbstractCegarLoop]: Abstraction has has 420 places, 368 transitions, 2431 flow [2022-12-11 19:24:07,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.33333333333334) internal successors, (622), 3 states have internal predecessors, (622), 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-11 19:24:07,383 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:24:07,383 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:24:07,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-11 19:24:07,383 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:24:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:24:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 230009762, now seen corresponding path program 1 times [2022-12-11 19:24:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:24:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084147280] [2022-12-11 19:24:07,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:24:07,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:24:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:24:07,417 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-11 19:24:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:24:07,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084147280] [2022-12-11 19:24:07,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084147280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:24:07,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:24:07,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:24:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231874712] [2022-12-11 19:24:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:24:07,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:24:07,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:24:07,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:24:07,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:24:07,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 225 [2022-12-11 19:24:07,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 368 transitions, 2431 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-11 19:24:07,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:24:07,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 225 [2022-12-11 19:24:07,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:24:10,198 INFO L130 PetriNetUnfolder]: 1378/17127 cut-off events. [2022-12-11 19:24:10,199 INFO L131 PetriNetUnfolder]: For 57005/60502 co-relation queries the response was YES. [2022-12-11 19:24:10,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50159 conditions, 17127 events. 1378/17127 cut-off events. For 57005/60502 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 251897 event pairs, 503 based on Foata normal form. 510/16812 useless extension candidates. Maximal degree in co-relation 50071. Up to 1673 conditions per place. [2022-12-11 19:24:10,366 INFO L137 encePairwiseOnDemand]: 221/225 looper letters, 35 selfloop transitions, 9 changer transitions 2/360 dead transitions. [2022-12-11 19:24:10,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 360 transitions, 2420 flow [2022-12-11 19:24:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:24:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:24:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2022-12-11 19:24:10,367 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9377777777777778 [2022-12-11 19:24:10,367 INFO L175 Difference]: Start difference. First operand has 420 places, 368 transitions, 2431 flow. Second operand 3 states and 633 transitions. [2022-12-11 19:24:10,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 360 transitions, 2420 flow [2022-12-11 19:24:10,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 360 transitions, 2349 flow, removed 7 selfloop flow, removed 18 redundant places. [2022-12-11 19:24:10,926 INFO L231 Difference]: Finished difference. Result has 400 places, 356 transitions, 2294 flow [2022-12-11 19:24:10,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=225, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2294, PETRI_PLACES=400, PETRI_TRANSITIONS=356} [2022-12-11 19:24:10,927 INFO L295 CegarLoopForPetriNet]: 203 programPoint places, 197 predicate places. [2022-12-11 19:24:10,927 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 356 transitions, 2294 flow [2022-12-11 19:24:10,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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-11 19:24:10,927 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:24:10,927 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:24:10,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-11 19:24:10,927 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 19:24:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:24:10,928 INFO L85 PathProgramCache]: Analyzing trace with hash -584389176, now seen corresponding path program 1 times [2022-12-11 19:24:10,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:24:10,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943067628] [2022-12-11 19:24:10,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:24:10,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:24:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:24:11,739 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-11 19:24:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:24:11,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943067628] [2022-12-11 19:24:11,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943067628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:24:11,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:24:11,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-12-11 19:24:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151592858] [2022-12-11 19:24:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:24:11,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-11 19:24:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:24:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-11 19:24:11,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2022-12-11 19:24:11,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 225 [2022-12-11 19:24:11,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 356 transitions, 2294 flow. Second operand has 34 states, 34 states have (on average 127.32352941176471) internal successors, (4329), 34 states have internal predecessors, (4329), 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-11 19:24:11,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:24:11,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 225 [2022-12-11 19:24:11,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand