/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-word-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:30:15,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:30:15,381 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:30:15,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:30:15,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:30:15,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:30:15,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:30:15,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:30:15,432 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:30:15,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:30:15,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:30:15,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:30:15,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:30:15,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:30:15,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:30:15,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:30:15,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:30:15,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:30:15,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:30:15,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:30:15,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:30:15,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:30:15,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:30:15,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:30:15,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:30:15,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:30:15,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:30:15,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:30:15,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:30:15,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:30:15,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:30:15,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:30:15,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:30:15,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:30:15,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:30:15,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:30:15,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:30:15,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:30:15,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:30:15,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:30:15,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:30:15,463 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:30:15,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:30:15,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:30:15,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:30:15,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:30:15,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:30:15,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:30:15,489 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:30:15,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:30:15,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:30:15,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:30:15,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:30:15,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:30:15,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:30:15,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:30:15,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:30:15,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:30:15,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:30:15,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:30:15,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:30:15,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:30:15,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:30:15,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:30:15,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:30:15,492 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:30:15,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:30:15,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:30:15,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:30:15,803 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:30:15,805 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:30:15,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-11 19:30:16,893 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:30:17,094 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:30:17,094 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-trans.wvr.c [2022-12-11 19:30:17,098 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b842fd1/8f7a33d62d7f42e9978e723bab675489/FLAGcd4af06c4 [2022-12-11 19:30:17,108 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71b842fd1/8f7a33d62d7f42e9978e723bab675489 [2022-12-11 19:30:17,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:30:17,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:30:17,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:30:17,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:30:17,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:30:17,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3ed3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17, skipping insertion in model container [2022-12-11 19:30:17,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:30:17,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:30:17,309 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-word-trans.wvr.c[3292,3305] [2022-12-11 19:30:17,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:30:17,333 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:30:17,371 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-word-trans.wvr.c[3292,3305] [2022-12-11 19:30:17,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:30:17,390 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:30:17,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17 WrapperNode [2022-12-11 19:30:17,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:30:17,393 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:30:17,393 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:30:17,393 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:30:17,398 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:30:17" (1/1) ... [2022-12-11 19:30:17,416 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:30:17" (1/1) ... [2022-12-11 19:30:17,444 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-12-11 19:30:17,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:30:17,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:30:17,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:30:17,446 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:30:17,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,487 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,489 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:30:17,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:30:17,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:30:17,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:30:17,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (1/1) ... [2022-12-11 19:30:17,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:30:17,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:30:17,522 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:30:17,539 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:30:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 19:30:17,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 19:30:17,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 19:30:17,563 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:30:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 19:30:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:30:17,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:30:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:30:17,565 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:30:17,679 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:30:17,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:30:18,058 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:30:18,065 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:30:18,065 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-11 19:30:18,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:30:18 BoogieIcfgContainer [2022-12-11 19:30:18,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:30:18,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:30:18,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:30:18,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:30:18,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:30:17" (1/3) ... [2022-12-11 19:30:18,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14195388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:30:18, skipping insertion in model container [2022-12-11 19:30:18,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:30:17" (2/3) ... [2022-12-11 19:30:18,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14195388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:30:18, skipping insertion in model container [2022-12-11 19:30:18,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:30:18" (3/3) ... [2022-12-11 19:30:18,072 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-12-11 19:30:18,083 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:30:18,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 19:30:18,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:30:18,135 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 19:30:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 282 transitions, 588 flow [2022-12-11 19:30:18,221 INFO L130 PetriNetUnfolder]: 28/279 cut-off events. [2022-12-11 19:30:18,221 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:30:18,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 279 events. 28/279 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 368 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-11 19:30:18,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 282 transitions, 588 flow [2022-12-11 19:30:18,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 251 places, 269 transitions, 556 flow [2022-12-11 19:30:18,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:30:18,246 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;@5cd9218c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:30:18,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 19:30:18,288 INFO L130 PetriNetUnfolder]: 28/268 cut-off events. [2022-12-11 19:30:18,288 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 19:30:18,289 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:18,289 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] [2022-12-11 19:30:18,290 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:30:18,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash -733290481, now seen corresponding path program 1 times [2022-12-11 19:30:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:18,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863934338] [2022-12-11 19:30:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:19,479 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:30:19,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863934338] [2022-12-11 19:30:19,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863934338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:19,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:19,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:19,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770138438] [2022-12-11 19:30:19,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:19,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:19,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:19,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:19,520 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-11 19:30:19,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 269 transitions, 556 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:19,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:19,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-11 19:30:19,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:20,205 INFO L130 PetriNetUnfolder]: 644/2464 cut-off events. [2022-12-11 19:30:20,205 INFO L131 PetriNetUnfolder]: For 205/205 co-relation queries the response was YES. [2022-12-11 19:30:20,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3367 conditions, 2464 events. 644/2464 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 20118 event pairs, 214 based on Foata normal form. 145/2207 useless extension candidates. Maximal degree in co-relation 2977. Up to 523 conditions per place. [2022-12-11 19:30:20,232 INFO L137 encePairwiseOnDemand]: 248/282 looper letters, 81 selfloop transitions, 15 changer transitions 14/301 dead transitions. [2022-12-11 19:30:20,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 301 transitions, 867 flow [2022-12-11 19:30:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-11 19:30:20,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-11 19:30:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2366 transitions. [2022-12-11 19:30:20,249 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7627337201805287 [2022-12-11 19:30:20,251 INFO L175 Difference]: Start difference. First operand has 251 places, 269 transitions, 556 flow. Second operand 11 states and 2366 transitions. [2022-12-11 19:30:20,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 301 transitions, 867 flow [2022-12-11 19:30:20,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 301 transitions, 837 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-11 19:30:20,263 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 590 flow [2022-12-11 19:30:20,265 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=590, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2022-12-11 19:30:20,271 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 9 predicate places. [2022-12-11 19:30:20,272 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 590 flow [2022-12-11 19:30:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:20,272 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:20,273 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] [2022-12-11 19:30:20,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:30:20,274 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:30:20,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash -940695419, now seen corresponding path program 2 times [2022-12-11 19:30:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:20,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435711406] [2022-12-11 19:30:20,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:20,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:20,749 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:30:20,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:20,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435711406] [2022-12-11 19:30:20,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435711406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:20,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:20,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:20,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191765599] [2022-12-11 19:30:20,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:20,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:20,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:20,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:20,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:20,756 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-11 19:30:20,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 590 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:20,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:20,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-11 19:30:20,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:21,252 INFO L130 PetriNetUnfolder]: 753/2758 cut-off events. [2022-12-11 19:30:21,252 INFO L131 PetriNetUnfolder]: For 816/955 co-relation queries the response was YES. [2022-12-11 19:30:21,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 2758 events. 753/2758 cut-off events. For 816/955 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 23893 event pairs, 356 based on Foata normal form. 8/2392 useless extension candidates. Maximal degree in co-relation 4469. Up to 644 conditions per place. [2022-12-11 19:30:21,275 INFO L137 encePairwiseOnDemand]: 271/282 looper letters, 97 selfloop transitions, 9 changer transitions 6/303 dead transitions. [2022-12-11 19:30:21,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 303 transitions, 978 flow [2022-12-11 19:30:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:30:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:30:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1723 transitions. [2022-12-11 19:30:21,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7637411347517731 [2022-12-11 19:30:21,278 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 590 flow. Second operand 8 states and 1723 transitions. [2022-12-11 19:30:21,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 303 transitions, 978 flow [2022-12-11 19:30:21,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 303 transitions, 962 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-11 19:30:21,333 INFO L231 Difference]: Finished difference. Result has 257 places, 263 transitions, 649 flow [2022-12-11 19:30:21,334 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=649, PETRI_PLACES=257, PETRI_TRANSITIONS=263} [2022-12-11 19:30:21,335 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 6 predicate places. [2022-12-11 19:30:21,335 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 263 transitions, 649 flow [2022-12-11 19:30:21,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:21,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:21,336 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] [2022-12-11 19:30:21,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:30:21,336 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:30:21,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1165285589, now seen corresponding path program 3 times [2022-12-11 19:30:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:21,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273157451] [2022-12-11 19:30:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:21,650 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:30:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:21,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273157451] [2022-12-11 19:30:21,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273157451] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:21,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:21,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:21,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553637296] [2022-12-11 19:30:21,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:21,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:21,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:21,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:21,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:21,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-11 19:30:21,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 263 transitions, 649 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:21,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:21,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-11 19:30:21,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:22,132 INFO L130 PetriNetUnfolder]: 740/2749 cut-off events. [2022-12-11 19:30:22,132 INFO L131 PetriNetUnfolder]: For 1573/1712 co-relation queries the response was YES. [2022-12-11 19:30:22,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 2749 events. 740/2749 cut-off events. For 1573/1712 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 24173 event pairs, 298 based on Foata normal form. 7/2398 useless extension candidates. Maximal degree in co-relation 4807. Up to 645 conditions per place. [2022-12-11 19:30:22,164 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 94 selfloop transitions, 15 changer transitions 4/304 dead transitions. [2022-12-11 19:30:22,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 304 transitions, 1044 flow [2022-12-11 19:30:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:30:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:30:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1523 transitions. [2022-12-11 19:30:22,168 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7715298885511651 [2022-12-11 19:30:22,168 INFO L175 Difference]: Start difference. First operand has 257 places, 263 transitions, 649 flow. Second operand 7 states and 1523 transitions. [2022-12-11 19:30:22,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 304 transitions, 1044 flow [2022-12-11 19:30:22,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 304 transitions, 1024 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-11 19:30:22,185 INFO L231 Difference]: Finished difference. Result has 262 places, 273 transitions, 781 flow [2022-12-11 19:30:22,186 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=262, PETRI_TRANSITIONS=273} [2022-12-11 19:30:22,188 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 11 predicate places. [2022-12-11 19:30:22,188 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 273 transitions, 781 flow [2022-12-11 19:30:22,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:22,189 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:22,189 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] [2022-12-11 19:30:22,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:30:22,190 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:30:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:22,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1541087517, now seen corresponding path program 4 times [2022-12-11 19:30:22,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:22,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165760261] [2022-12-11 19:30:22,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:22,518 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:30:22,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:22,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165760261] [2022-12-11 19:30:22,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165760261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:22,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:22,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422572122] [2022-12-11 19:30:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:22,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:22,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:22,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:22,523 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-11 19:30:22,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 273 transitions, 781 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:22,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:22,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-11 19:30:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:23,019 INFO L130 PetriNetUnfolder]: 790/3283 cut-off events. [2022-12-11 19:30:23,020 INFO L131 PetriNetUnfolder]: For 3358/3489 co-relation queries the response was YES. [2022-12-11 19:30:23,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6075 conditions, 3283 events. 790/3283 cut-off events. For 3358/3489 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 31404 event pairs, 330 based on Foata normal form. 17/2889 useless extension candidates. Maximal degree in co-relation 6010. Up to 832 conditions per place. [2022-12-11 19:30:23,108 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 110 selfloop transitions, 12 changer transitions 6/319 dead transitions. [2022-12-11 19:30:23,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 319 transitions, 1282 flow [2022-12-11 19:30:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:30:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:30:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1925 transitions. [2022-12-11 19:30:23,112 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7584712371946415 [2022-12-11 19:30:23,112 INFO L175 Difference]: Start difference. First operand has 262 places, 273 transitions, 781 flow. Second operand 9 states and 1925 transitions. [2022-12-11 19:30:23,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 319 transitions, 1282 flow [2022-12-11 19:30:23,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 319 transitions, 1252 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-11 19:30:23,127 INFO L231 Difference]: Finished difference. Result has 271 places, 278 transitions, 874 flow [2022-12-11 19:30:23,147 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=874, PETRI_PLACES=271, PETRI_TRANSITIONS=278} [2022-12-11 19:30:23,148 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 20 predicate places. [2022-12-11 19:30:23,149 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 278 transitions, 874 flow [2022-12-11 19:30:23,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:23,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:23,150 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] [2022-12-11 19:30:23,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:30:23,150 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:30:23,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1434190913, now seen corresponding path program 5 times [2022-12-11 19:30:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:23,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722951941] [2022-12-11 19:30:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:23,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:30:23,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:23,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722951941] [2022-12-11 19:30:23,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722951941] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:23,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:23,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15970542] [2022-12-11 19:30:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:23,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:23,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:23,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:23,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:23,556 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-11 19:30:23,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 278 transitions, 874 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:23,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:23,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-11 19:30:23,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:24,081 INFO L130 PetriNetUnfolder]: 807/3341 cut-off events. [2022-12-11 19:30:24,081 INFO L131 PetriNetUnfolder]: For 4359/4536 co-relation queries the response was YES. [2022-12-11 19:30:24,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6445 conditions, 3341 events. 807/3341 cut-off events. For 4359/4536 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 32249 event pairs, 320 based on Foata normal form. 16/2951 useless extension candidates. Maximal degree in co-relation 6371. Up to 833 conditions per place. [2022-12-11 19:30:24,106 INFO L137 encePairwiseOnDemand]: 268/282 looper letters, 109 selfloop transitions, 24 changer transitions 4/328 dead transitions. [2022-12-11 19:30:24,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 328 transitions, 1395 flow [2022-12-11 19:30:24,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:30:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:30:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1725 transitions. [2022-12-11 19:30:24,109 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7646276595744681 [2022-12-11 19:30:24,109 INFO L175 Difference]: Start difference. First operand has 271 places, 278 transitions, 874 flow. Second operand 8 states and 1725 transitions. [2022-12-11 19:30:24,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 328 transitions, 1395 flow [2022-12-11 19:30:24,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 328 transitions, 1365 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-11 19:30:24,133 INFO L231 Difference]: Finished difference. Result has 276 places, 290 transitions, 1057 flow [2022-12-11 19:30:24,134 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1057, PETRI_PLACES=276, PETRI_TRANSITIONS=290} [2022-12-11 19:30:24,134 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 25 predicate places. [2022-12-11 19:30:24,134 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 290 transitions, 1057 flow [2022-12-11 19:30:24,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:24,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:24,135 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] [2022-12-11 19:30:24,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:30:24,136 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:30:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash -788395583, now seen corresponding path program 6 times [2022-12-11 19:30:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:24,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238778382] [2022-12-11 19:30:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:24,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:24,522 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:30:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238778382] [2022-12-11 19:30:24,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238778382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:24,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:24,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:24,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936415089] [2022-12-11 19:30:24,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:24,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:24,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:24,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:24,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 282 [2022-12-11 19:30:24,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 290 transitions, 1057 flow. Second operand has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:24,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:24,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 282 [2022-12-11 19:30:24,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:25,115 INFO L130 PetriNetUnfolder]: 869/3803 cut-off events. [2022-12-11 19:30:25,115 INFO L131 PetriNetUnfolder]: For 6559/6710 co-relation queries the response was YES. [2022-12-11 19:30:25,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7575 conditions, 3803 events. 869/3803 cut-off events. For 6559/6710 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 38188 event pairs, 248 based on Foata normal form. 26/3419 useless extension candidates. Maximal degree in co-relation 7503. Up to 778 conditions per place. [2022-12-11 19:30:25,140 INFO L137 encePairwiseOnDemand]: 268/282 looper letters, 93 selfloop transitions, 47 changer transitions 4/335 dead transitions. [2022-12-11 19:30:25,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 335 transitions, 1595 flow [2022-12-11 19:30:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:30:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:30:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1725 transitions. [2022-12-11 19:30:25,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7646276595744681 [2022-12-11 19:30:25,144 INFO L175 Difference]: Start difference. First operand has 276 places, 290 transitions, 1057 flow. Second operand 8 states and 1725 transitions. [2022-12-11 19:30:25,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 335 transitions, 1595 flow [2022-12-11 19:30:25,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 335 transitions, 1568 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-12-11 19:30:25,189 INFO L231 Difference]: Finished difference. Result has 282 places, 304 transitions, 1317 flow [2022-12-11 19:30:25,194 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1317, PETRI_PLACES=282, PETRI_TRANSITIONS=304} [2022-12-11 19:30:25,212 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 31 predicate places. [2022-12-11 19:30:25,212 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 304 transitions, 1317 flow [2022-12-11 19:30:25,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 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:30:25,213 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:25,213 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:30:25,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:30:25,213 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:30:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash -460812762, now seen corresponding path program 1 times [2022-12-11 19:30:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:25,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261852084] [2022-12-11 19:30:25,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:25,395 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:30:25,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261852084] [2022-12-11 19:30:25,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261852084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:25,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:25,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:30:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511126779] [2022-12-11 19:30:25,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:25,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:30:25,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:25,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:30:25,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:30:25,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 282 [2022-12-11 19:30:25,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 304 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:30:25,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:25,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 282 [2022-12-11 19:30:25,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:25,644 INFO L130 PetriNetUnfolder]: 150/1423 cut-off events. [2022-12-11 19:30:25,644 INFO L131 PetriNetUnfolder]: For 2390/2599 co-relation queries the response was YES. [2022-12-11 19:30:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 1423 events. 150/1423 cut-off events. For 2390/2599 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11560 event pairs, 12 based on Foata normal form. 4/1299 useless extension candidates. Maximal degree in co-relation 2605. Up to 102 conditions per place. [2022-12-11 19:30:25,653 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 14 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2022-12-11 19:30:25,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 310 transitions, 1366 flow [2022-12-11 19:30:25,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:30:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:30:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2022-12-11 19:30:25,655 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9349881796690307 [2022-12-11 19:30:25,655 INFO L175 Difference]: Start difference. First operand has 282 places, 304 transitions, 1317 flow. Second operand 3 states and 791 transitions. [2022-12-11 19:30:25,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 310 transitions, 1366 flow [2022-12-11 19:30:25,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 310 transitions, 1292 flow, removed 16 selfloop flow, removed 4 redundant places. [2022-12-11 19:30:25,664 INFO L231 Difference]: Finished difference. Result has 279 places, 304 transitions, 1251 flow [2022-12-11 19:30:25,665 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1251, PETRI_PLACES=279, PETRI_TRANSITIONS=304} [2022-12-11 19:30:25,665 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 28 predicate places. [2022-12-11 19:30:25,666 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 304 transitions, 1251 flow [2022-12-11 19:30:25,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:30:25,666 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:25,666 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:30:25,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 19:30:25,667 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:30:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1578606610, now seen corresponding path program 1 times [2022-12-11 19:30:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:25,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940371203] [2022-12-11 19:30:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:25,735 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:30:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:25,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940371203] [2022-12-11 19:30:25,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940371203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:25,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:25,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:30:25,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809036238] [2022-12-11 19:30:25,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:25,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:30:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:25,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:30:25,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:30:25,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 282 [2022-12-11 19:30:25,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 304 transitions, 1251 flow. Second operand has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:30:25,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:25,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 282 [2022-12-11 19:30:25,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:25,958 INFO L130 PetriNetUnfolder]: 250/1931 cut-off events. [2022-12-11 19:30:25,958 INFO L131 PetriNetUnfolder]: For 2595/2699 co-relation queries the response was YES. [2022-12-11 19:30:25,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 1931 events. 250/1931 cut-off events. For 2595/2699 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17193 event pairs, 46 based on Foata normal form. 4/1751 useless extension candidates. Maximal degree in co-relation 2945. Up to 131 conditions per place. [2022-12-11 19:30:25,977 INFO L137 encePairwiseOnDemand]: 279/282 looper letters, 13 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2022-12-11 19:30:25,977 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 309 transitions, 1295 flow [2022-12-11 19:30:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:30:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:30:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2022-12-11 19:30:25,979 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.933806146572104 [2022-12-11 19:30:25,979 INFO L175 Difference]: Start difference. First operand has 279 places, 304 transitions, 1251 flow. Second operand 3 states and 790 transitions. [2022-12-11 19:30:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 309 transitions, 1295 flow [2022-12-11 19:30:25,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 309 transitions, 1291 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:30:25,991 INFO L231 Difference]: Finished difference. Result has 280 places, 304 transitions, 1255 flow [2022-12-11 19:30:25,991 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1255, PETRI_PLACES=280, PETRI_TRANSITIONS=304} [2022-12-11 19:30:25,992 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 29 predicate places. [2022-12-11 19:30:25,992 INFO L495 AbstractCegarLoop]: Abstraction has has 280 places, 304 transitions, 1255 flow [2022-12-11 19:30:25,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 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:30:25,993 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:25,993 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] [2022-12-11 19:30:25,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 19:30:25,993 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:30:25,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1138273313, now seen corresponding path program 1 times [2022-12-11 19:30:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:25,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103396592] [2022-12-11 19:30:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:26,314 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:30:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:26,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103396592] [2022-12-11 19:30:26,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103396592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:26,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:26,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932886280] [2022-12-11 19:30:26,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:26,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:26,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:26,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 304 transitions, 1255 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:26,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:26,318 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:26,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:26,955 INFO L130 PetriNetUnfolder]: 961/4862 cut-off events. [2022-12-11 19:30:26,955 INFO L131 PetriNetUnfolder]: For 10867/11670 co-relation queries the response was YES. [2022-12-11 19:30:26,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10292 conditions, 4862 events. 961/4862 cut-off events. For 10867/11670 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 51676 event pairs, 238 based on Foata normal form. 42/4542 useless extension candidates. Maximal degree in co-relation 9412. Up to 743 conditions per place. [2022-12-11 19:30:27,002 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 139 selfloop transitions, 12 changer transitions 4/353 dead transitions. [2022-12-11 19:30:27,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 353 transitions, 1945 flow [2022-12-11 19:30:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:30:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:30:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1950 transitions. [2022-12-11 19:30:27,006 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7683215130023641 [2022-12-11 19:30:27,006 INFO L175 Difference]: Start difference. First operand has 280 places, 304 transitions, 1255 flow. Second operand 9 states and 1950 transitions. [2022-12-11 19:30:27,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 353 transitions, 1945 flow [2022-12-11 19:30:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 353 transitions, 1941 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-11 19:30:27,032 INFO L231 Difference]: Finished difference. Result has 291 places, 310 transitions, 1394 flow [2022-12-11 19:30:27,033 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1394, PETRI_PLACES=291, PETRI_TRANSITIONS=310} [2022-12-11 19:30:27,033 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 40 predicate places. [2022-12-11 19:30:27,034 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 310 transitions, 1394 flow [2022-12-11 19:30:27,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:27,034 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:27,034 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] [2022-12-11 19:30:27,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 19:30:27,035 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:30:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1417108577, now seen corresponding path program 2 times [2022-12-11 19:30:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:27,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239340817] [2022-12-11 19:30:27,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:27,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:27,286 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:30:27,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:27,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239340817] [2022-12-11 19:30:27,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239340817] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:27,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:27,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:27,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605680514] [2022-12-11 19:30:27,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:27,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:27,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:27,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:27,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:27,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:27,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 310 transitions, 1394 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:27,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:27,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:27,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:27,909 INFO L130 PetriNetUnfolder]: 944/4498 cut-off events. [2022-12-11 19:30:27,909 INFO L131 PetriNetUnfolder]: For 12355/12976 co-relation queries the response was YES. [2022-12-11 19:30:27,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10033 conditions, 4498 events. 944/4498 cut-off events. For 12355/12976 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 46260 event pairs, 428 based on Foata normal form. 57/4133 useless extension candidates. Maximal degree in co-relation 9873. Up to 1019 conditions per place. [2022-12-11 19:30:27,951 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 127 selfloop transitions, 16 changer transitions 5/346 dead transitions. [2022-12-11 19:30:27,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 346 transitions, 1948 flow [2022-12-11 19:30:27,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:30:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:30:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1947 transitions. [2022-12-11 19:30:27,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7671394799054374 [2022-12-11 19:30:27,954 INFO L175 Difference]: Start difference. First operand has 291 places, 310 transitions, 1394 flow. Second operand 9 states and 1947 transitions. [2022-12-11 19:30:27,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 346 transitions, 1948 flow [2022-12-11 19:30:27,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 346 transitions, 1904 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-12-11 19:30:27,983 INFO L231 Difference]: Finished difference. Result has 297 places, 314 transitions, 1487 flow [2022-12-11 19:30:27,984 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1487, PETRI_PLACES=297, PETRI_TRANSITIONS=314} [2022-12-11 19:30:27,984 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 46 predicate places. [2022-12-11 19:30:27,984 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 314 transitions, 1487 flow [2022-12-11 19:30:27,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:27,985 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:27,985 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] [2022-12-11 19:30:27,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 19:30:27,986 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:30:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash -698801115, now seen corresponding path program 3 times [2022-12-11 19:30:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:27,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500229863] [2022-12-11 19:30:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:28,380 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:30:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:28,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500229863] [2022-12-11 19:30:28,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500229863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:28,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:28,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-12-11 19:30:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655711293] [2022-12-11 19:30:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:28,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-11 19:30:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-11 19:30:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-12-11 19:30:28,385 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 282 [2022-12-11 19:30:28,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 314 transitions, 1487 flow. Second operand has 17 states, 17 states have (on average 181.64705882352942) internal successors, (3088), 17 states have internal predecessors, (3088), 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:30:28,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:28,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 282 [2022-12-11 19:30:28,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:30,258 INFO L130 PetriNetUnfolder]: 2484/10139 cut-off events. [2022-12-11 19:30:30,258 INFO L131 PetriNetUnfolder]: For 17827/18337 co-relation queries the response was YES. [2022-12-11 19:30:30,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20790 conditions, 10139 events. 2484/10139 cut-off events. For 17827/18337 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 118369 event pairs, 579 based on Foata normal form. 90/8869 useless extension candidates. Maximal degree in co-relation 20542. Up to 1412 conditions per place. [2022-12-11 19:30:30,401 INFO L137 encePairwiseOnDemand]: 257/282 looper letters, 191 selfloop transitions, 43 changer transitions 6/444 dead transitions. [2022-12-11 19:30:30,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 444 transitions, 2734 flow [2022-12-11 19:30:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 19:30:30,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 19:30:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4271 transitions. [2022-12-11 19:30:30,408 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.658495220474869 [2022-12-11 19:30:30,408 INFO L175 Difference]: Start difference. First operand has 297 places, 314 transitions, 1487 flow. Second operand 23 states and 4271 transitions. [2022-12-11 19:30:30,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 444 transitions, 2734 flow [2022-12-11 19:30:30,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 444 transitions, 2675 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-11 19:30:30,442 INFO L231 Difference]: Finished difference. Result has 324 places, 338 transitions, 1755 flow [2022-12-11 19:30:30,442 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1755, PETRI_PLACES=324, PETRI_TRANSITIONS=338} [2022-12-11 19:30:30,443 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 73 predicate places. [2022-12-11 19:30:30,443 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 338 transitions, 1755 flow [2022-12-11 19:30:30,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 181.64705882352942) internal successors, (3088), 17 states have internal predecessors, (3088), 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:30:30,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:30,444 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] [2022-12-11 19:30:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 19:30:30,444 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:30:30,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1841795159, now seen corresponding path program 1 times [2022-12-11 19:30:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:30,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432322283] [2022-12-11 19:30:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:30,662 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:30:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:30,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432322283] [2022-12-11 19:30:30,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432322283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:30,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949682904] [2022-12-11 19:30:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:30,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:30,664 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:30,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 338 transitions, 1755 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:30,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:30,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:30,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:32,525 INFO L130 PetriNetUnfolder]: 2140/12279 cut-off events. [2022-12-11 19:30:32,525 INFO L131 PetriNetUnfolder]: For 28590/28714 co-relation queries the response was YES. [2022-12-11 19:30:32,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26017 conditions, 12279 events. 2140/12279 cut-off events. For 28590/28714 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 158213 event pairs, 762 based on Foata normal form. 35/11101 useless extension candidates. Maximal degree in co-relation 25614. Up to 1779 conditions per place. [2022-12-11 19:30:32,645 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 132 selfloop transitions, 28 changer transitions 10/408 dead transitions. [2022-12-11 19:30:32,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 408 transitions, 2773 flow [2022-12-11 19:30:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:30:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:30:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1947 transitions. [2022-12-11 19:30:32,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7671394799054374 [2022-12-11 19:30:32,649 INFO L175 Difference]: Start difference. First operand has 324 places, 338 transitions, 1755 flow. Second operand 9 states and 1947 transitions. [2022-12-11 19:30:32,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 408 transitions, 2773 flow [2022-12-11 19:30:32,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 408 transitions, 2730 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-12-11 19:30:32,750 INFO L231 Difference]: Finished difference. Result has 329 places, 351 transitions, 2008 flow [2022-12-11 19:30:32,751 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1733, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2008, PETRI_PLACES=329, PETRI_TRANSITIONS=351} [2022-12-11 19:30:32,753 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 78 predicate places. [2022-12-11 19:30:32,753 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 351 transitions, 2008 flow [2022-12-11 19:30:32,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:32,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:32,754 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] [2022-12-11 19:30:32,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 19:30:32,754 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:30:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash -427857877, now seen corresponding path program 2 times [2022-12-11 19:30:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:32,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734913824] [2022-12-11 19:30:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:32,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:33,096 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:30:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:33,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734913824] [2022-12-11 19:30:33,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734913824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:33,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:33,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:33,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220107465] [2022-12-11 19:30:33,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:33,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:33,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:33,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:33,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:33,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:33,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 351 transitions, 2008 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:33,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:33,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:33,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:34,638 INFO L130 PetriNetUnfolder]: 1813/9853 cut-off events. [2022-12-11 19:30:34,638 INFO L131 PetriNetUnfolder]: For 33681/34025 co-relation queries the response was YES. [2022-12-11 19:30:34,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23311 conditions, 9853 events. 1813/9853 cut-off events. For 33681/34025 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 121573 event pairs, 343 based on Foata normal form. 28/9196 useless extension candidates. Maximal degree in co-relation 22905. Up to 2001 conditions per place. [2022-12-11 19:30:34,749 INFO L137 encePairwiseOnDemand]: 271/282 looper letters, 119 selfloop transitions, 39 changer transitions 11/405 dead transitions. [2022-12-11 19:30:34,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 405 transitions, 2789 flow [2022-12-11 19:30:34,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:30:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:30:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1752 transitions. [2022-12-11 19:30:34,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.776595744680851 [2022-12-11 19:30:34,752 INFO L175 Difference]: Start difference. First operand has 329 places, 351 transitions, 2008 flow. Second operand 8 states and 1752 transitions. [2022-12-11 19:30:34,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 405 transitions, 2789 flow [2022-12-11 19:30:34,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 405 transitions, 2753 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-11 19:30:34,852 INFO L231 Difference]: Finished difference. Result has 333 places, 364 transitions, 2273 flow [2022-12-11 19:30:34,853 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2273, PETRI_PLACES=333, PETRI_TRANSITIONS=364} [2022-12-11 19:30:34,853 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 82 predicate places. [2022-12-11 19:30:34,853 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 364 transitions, 2273 flow [2022-12-11 19:30:34,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:34,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:34,854 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] [2022-12-11 19:30:34,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 19:30:34,854 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:30:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:34,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1660677777, now seen corresponding path program 3 times [2022-12-11 19:30:34,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:34,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35009435] [2022-12-11 19:30:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:35,205 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:30:35,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:35,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35009435] [2022-12-11 19:30:35,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35009435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:35,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:35,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:35,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134131289] [2022-12-11 19:30:35,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:35,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:35,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:35,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:35,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:35,207 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:35,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 364 transitions, 2273 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:35,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:35,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:35,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:36,617 INFO L130 PetriNetUnfolder]: 1904/10602 cut-off events. [2022-12-11 19:30:36,617 INFO L131 PetriNetUnfolder]: For 36662/37222 co-relation queries the response was YES. [2022-12-11 19:30:36,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25222 conditions, 10602 events. 1904/10602 cut-off events. For 36662/37222 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 133450 event pairs, 897 based on Foata normal form. 42/9723 useless extension candidates. Maximal degree in co-relation 24824. Up to 2311 conditions per place. [2022-12-11 19:30:36,693 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 125 selfloop transitions, 32 changer transitions 11/402 dead transitions. [2022-12-11 19:30:36,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 402 transitions, 2878 flow [2022-12-11 19:30:36,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:30:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:30:36,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2022-12-11 19:30:36,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7776089159067883 [2022-12-11 19:30:36,695 INFO L175 Difference]: Start difference. First operand has 333 places, 364 transitions, 2273 flow. Second operand 7 states and 1535 transitions. [2022-12-11 19:30:36,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 402 transitions, 2878 flow [2022-12-11 19:30:36,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 402 transitions, 2730 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-11 19:30:36,800 INFO L231 Difference]: Finished difference. Result has 333 places, 366 transitions, 2233 flow [2022-12-11 19:30:36,800 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2233, PETRI_PLACES=333, PETRI_TRANSITIONS=366} [2022-12-11 19:30:36,801 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 82 predicate places. [2022-12-11 19:30:36,801 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 366 transitions, 2233 flow [2022-12-11 19:30:36,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:36,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:36,802 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] [2022-12-11 19:30:36,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 19:30:36,802 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:30:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:36,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1169520207, now seen corresponding path program 1 times [2022-12-11 19:30:36,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:36,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728587829] [2022-12-11 19:30:36,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:36,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:37,217 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:30:37,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:37,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728587829] [2022-12-11 19:30:37,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728587829] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:37,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:37,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-11 19:30:37,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156956383] [2022-12-11 19:30:37,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:37,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 19:30:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 19:30:37,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-12-11 19:30:37,222 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 282 [2022-12-11 19:30:37,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 366 transitions, 2233 flow. Second operand has 14 states, 14 states have (on average 185.21428571428572) internal successors, (2593), 14 states have internal predecessors, (2593), 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:30:37,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:37,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 282 [2022-12-11 19:30:37,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:41,586 INFO L130 PetriNetUnfolder]: 5834/25066 cut-off events. [2022-12-11 19:30:41,586 INFO L131 PetriNetUnfolder]: For 70981/72283 co-relation queries the response was YES. [2022-12-11 19:30:41,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55838 conditions, 25066 events. 5834/25066 cut-off events. For 70981/72283 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 345237 event pairs, 1873 based on Foata normal form. 112/21932 useless extension candidates. Maximal degree in co-relation 55195. Up to 3022 conditions per place. [2022-12-11 19:30:41,939 INFO L137 encePairwiseOnDemand]: 261/282 looper letters, 179 selfloop transitions, 66 changer transitions 9/484 dead transitions. [2022-12-11 19:30:41,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 484 transitions, 3626 flow [2022-12-11 19:30:41,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 19:30:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 19:30:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3768 transitions. [2022-12-11 19:30:41,944 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6680851063829787 [2022-12-11 19:30:41,944 INFO L175 Difference]: Start difference. First operand has 333 places, 366 transitions, 2233 flow. Second operand 20 states and 3768 transitions. [2022-12-11 19:30:41,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 484 transitions, 3626 flow [2022-12-11 19:30:42,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 484 transitions, 3508 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-12-11 19:30:42,303 INFO L231 Difference]: Finished difference. Result has 355 places, 395 transitions, 2678 flow [2022-12-11 19:30:42,304 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2678, PETRI_PLACES=355, PETRI_TRANSITIONS=395} [2022-12-11 19:30:42,304 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 104 predicate places. [2022-12-11 19:30:42,304 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 395 transitions, 2678 flow [2022-12-11 19:30:42,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 185.21428571428572) internal successors, (2593), 14 states have internal predecessors, (2593), 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:30:42,305 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:42,310 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] [2022-12-11 19:30:42,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 19:30:42,313 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:30:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2146197801, now seen corresponding path program 4 times [2022-12-11 19:30:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555008893] [2022-12-11 19:30:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:42,574 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:30:42,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555008893] [2022-12-11 19:30:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555008893] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:42,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:42,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573848925] [2022-12-11 19:30:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:42,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:42,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:42,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:42,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 395 transitions, 2678 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:42,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:42,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:46,038 INFO L130 PetriNetUnfolder]: 3755/20901 cut-off events. [2022-12-11 19:30:46,038 INFO L131 PetriNetUnfolder]: For 75218/76423 co-relation queries the response was YES. [2022-12-11 19:30:46,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50819 conditions, 20901 events. 3755/20901 cut-off events. For 75218/76423 co-relation queries the response was YES. Maximal size of possible extension queue 878. Compared 298078 event pairs, 1895 based on Foata normal form. 72/19220 useless extension candidates. Maximal degree in co-relation 50189. Up to 4640 conditions per place. [2022-12-11 19:30:46,191 INFO L137 encePairwiseOnDemand]: 274/282 looper letters, 152 selfloop transitions, 23 changer transitions 14/425 dead transitions. [2022-12-11 19:30:46,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 425 transitions, 3231 flow [2022-12-11 19:30:46,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:30:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:30:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1736 transitions. [2022-12-11 19:30:46,211 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7695035460992907 [2022-12-11 19:30:46,211 INFO L175 Difference]: Start difference. First operand has 355 places, 395 transitions, 2678 flow. Second operand 8 states and 1736 transitions. [2022-12-11 19:30:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 425 transitions, 3231 flow [2022-12-11 19:30:46,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 425 transitions, 3178 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-11 19:30:46,518 INFO L231 Difference]: Finished difference. Result has 356 places, 389 transitions, 2571 flow [2022-12-11 19:30:46,518 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2635, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2571, PETRI_PLACES=356, PETRI_TRANSITIONS=389} [2022-12-11 19:30:46,519 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 105 predicate places. [2022-12-11 19:30:46,519 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 389 transitions, 2571 flow [2022-12-11 19:30:46,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:46,519 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:46,520 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] [2022-12-11 19:30:46,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 19:30:46,520 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:30:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2044461285, now seen corresponding path program 5 times [2022-12-11 19:30:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:46,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385986606] [2022-12-11 19:30:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:46,740 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:30:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:46,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385986606] [2022-12-11 19:30:46,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385986606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:46,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:46,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811510995] [2022-12-11 19:30:46,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:46,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:46,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:46,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:46,743 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:46,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 389 transitions, 2571 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:46,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:46,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:50,644 INFO L130 PetriNetUnfolder]: 3822/21598 cut-off events. [2022-12-11 19:30:50,644 INFO L131 PetriNetUnfolder]: For 73355/74496 co-relation queries the response was YES. [2022-12-11 19:30:50,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50900 conditions, 21598 events. 3822/21598 cut-off events. For 73355/74496 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 308493 event pairs, 465 based on Foata normal form. 226/20086 useless extension candidates. Maximal degree in co-relation 50209. Up to 2959 conditions per place. [2022-12-11 19:30:50,801 INFO L137 encePairwiseOnDemand]: 269/282 looper letters, 168 selfloop transitions, 61 changer transitions 16/478 dead transitions. [2022-12-11 19:30:50,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 478 transitions, 4004 flow [2022-12-11 19:30:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 19:30:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 19:30:50,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2178 transitions. [2022-12-11 19:30:50,819 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7723404255319148 [2022-12-11 19:30:50,819 INFO L175 Difference]: Start difference. First operand has 356 places, 389 transitions, 2571 flow. Second operand 10 states and 2178 transitions. [2022-12-11 19:30:50,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 478 transitions, 4004 flow [2022-12-11 19:30:51,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 478 transitions, 3888 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-11 19:30:51,054 INFO L231 Difference]: Finished difference. Result has 358 places, 411 transitions, 3010 flow [2022-12-11 19:30:51,054 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3010, PETRI_PLACES=358, PETRI_TRANSITIONS=411} [2022-12-11 19:30:51,060 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 107 predicate places. [2022-12-11 19:30:51,060 INFO L495 AbstractCegarLoop]: Abstraction has has 358 places, 411 transitions, 3010 flow [2022-12-11 19:30:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:51,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:51,061 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] [2022-12-11 19:30:51,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 19:30:51,061 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:30:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1491191941, now seen corresponding path program 6 times [2022-12-11 19:30:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:51,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380015710] [2022-12-11 19:30:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:51,444 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:30:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:51,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380015710] [2022-12-11 19:30:51,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380015710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:51,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:51,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372457353] [2022-12-11 19:30:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:51,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:51,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:51,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:51,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:51,447 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:51,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 411 transitions, 3010 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:51,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:51,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:51,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:54,682 INFO L130 PetriNetUnfolder]: 3736/21195 cut-off events. [2022-12-11 19:30:54,682 INFO L131 PetriNetUnfolder]: For 82026/83100 co-relation queries the response was YES. [2022-12-11 19:30:54,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50918 conditions, 21195 events. 3736/21195 cut-off events. For 82026/83100 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 300173 event pairs, 726 based on Foata normal form. 204/19706 useless extension candidates. Maximal degree in co-relation 50247. Up to 3862 conditions per place. [2022-12-11 19:30:54,832 INFO L137 encePairwiseOnDemand]: 269/282 looper letters, 157 selfloop transitions, 62 changer transitions 12/462 dead transitions. [2022-12-11 19:30:54,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 462 transitions, 3861 flow [2022-12-11 19:30:54,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:30:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:30:54,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1960 transitions. [2022-12-11 19:30:54,848 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7722616233254531 [2022-12-11 19:30:54,848 INFO L175 Difference]: Start difference. First operand has 358 places, 411 transitions, 3010 flow. Second operand 9 states and 1960 transitions. [2022-12-11 19:30:54,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 462 transitions, 3861 flow [2022-12-11 19:30:55,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 462 transitions, 3728 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-11 19:30:55,060 INFO L231 Difference]: Finished difference. Result has 362 places, 414 transitions, 3066 flow [2022-12-11 19:30:55,061 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2911, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3066, PETRI_PLACES=362, PETRI_TRANSITIONS=414} [2022-12-11 19:30:55,061 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 111 predicate places. [2022-12-11 19:30:55,061 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 414 transitions, 3066 flow [2022-12-11 19:30:55,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:55,061 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:30:55,062 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] [2022-12-11 19:30:55,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-11 19:30:55,062 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:30:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:30:55,063 INFO L85 PathProgramCache]: Analyzing trace with hash -229785313, now seen corresponding path program 1 times [2022-12-11 19:30:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:30:55,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129997292] [2022-12-11 19:30:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:30:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:30:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:30:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:30:55,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:30:55,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129997292] [2022-12-11 19:30:55,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129997292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:30:55,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:30:55,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:30:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232467210] [2022-12-11 19:30:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:30:55,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:30:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:30:55,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:30:55,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:30:55,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:30:55,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 414 transitions, 3066 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:30:55,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:30:55,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:30:55,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:30:59,603 INFO L130 PetriNetUnfolder]: 5399/27328 cut-off events. [2022-12-11 19:30:59,603 INFO L131 PetriNetUnfolder]: For 105015/107150 co-relation queries the response was YES. [2022-12-11 19:30:59,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68410 conditions, 27328 events. 5399/27328 cut-off events. For 105015/107150 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 397793 event pairs, 847 based on Foata normal form. 318/25899 useless extension candidates. Maximal degree in co-relation 67526. Up to 3009 conditions per place. [2022-12-11 19:31:00,026 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 248 selfloop transitions, 50 changer transitions 10/549 dead transitions. [2022-12-11 19:31:00,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 549 transitions, 5204 flow [2022-12-11 19:31:00,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:31:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:31:00,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1973 transitions. [2022-12-11 19:31:00,046 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7773837667454688 [2022-12-11 19:31:00,046 INFO L175 Difference]: Start difference. First operand has 362 places, 414 transitions, 3066 flow. Second operand 9 states and 1973 transitions. [2022-12-11 19:31:00,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 549 transitions, 5204 flow [2022-12-11 19:31:00,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 549 transitions, 5031 flow, removed 47 selfloop flow, removed 4 redundant places. [2022-12-11 19:31:00,433 INFO L231 Difference]: Finished difference. Result has 368 places, 437 transitions, 3506 flow [2022-12-11 19:31:00,433 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=2971, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3506, PETRI_PLACES=368, PETRI_TRANSITIONS=437} [2022-12-11 19:31:00,434 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 117 predicate places. [2022-12-11 19:31:00,434 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 437 transitions, 3506 flow [2022-12-11 19:31:00,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:00,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:31:00,434 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] [2022-12-11 19:31:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-11 19:31:00,435 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:31:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:31:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1176724977, now seen corresponding path program 2 times [2022-12-11 19:31:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:31:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070313012] [2022-12-11 19:31:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:31:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:31:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:31:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:31:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:31:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070313012] [2022-12-11 19:31:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070313012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:31:00,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:31:00,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:31:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41055722] [2022-12-11 19:31:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:31:00,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:31:00,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:31:00,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:31:00,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:31:00,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:31:00,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 437 transitions, 3506 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:00,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:31:00,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:31:00,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:31:05,103 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] thread1EXIT-->L123-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][319], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), 734#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 528#(<= ~count1~0 ~count3~0), Black: 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 4#L68-1true, Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), 114#L100true, Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 722#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 724#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 41#L123-2true, 267#true, Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 599#(<= ~res2~0 0), 413#(<= ~count2~0 ~count1~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-11 19:31:05,103 INFO L382 tUnfolder$Statistics]: this new event has 172 ancestors and is cut-off event [2022-12-11 19:31:05,103 INFO L385 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-12-11 19:31:05,104 INFO L385 tUnfolder$Statistics]: existing Event has 172 ancestors and is cut-off event [2022-12-11 19:31:05,104 INFO L385 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-12-11 19:31:05,422 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([774] thread1EXIT-->L123-2: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_5|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][279], [Black: 629#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 621#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 501#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), Black: 619#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 493#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (or (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 474#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~res1~0 0)), 687#true, Black: 489#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= ~res1~0 0)), Black: 495#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (or (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~res1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (and (<= (+ (* (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 4294967296) ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1))))), Black: 505#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 483#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 509#(and (<= 0 (+ ~n2~0 2147483648)) (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), 717#(and (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 491#(and (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2147483648)) (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (or (<= (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1) 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0)) (<= ~res1~0 0)), Black: 499#(and (<= 0 (+ ~n2~0 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= 0 (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| 2147483648)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (< 0 (+ (div |ULTIMATE.start_create_fresh_int_array_~size#1| 4294967296) 1)) (<= ~res1~0 0)), 733#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 390#(and (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 392#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), 627#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 405#(= thread1Thread1of1ForFork0_~stop~0 0), Black: 409#(= thread2Thread1of1ForFork1_~stop~1 0), Black: 536#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 538#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~res2~0 1) 0)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0))), Black: 277#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1))), Black: 528#(<= ~count1~0 ~count3~0), Black: 279#(and (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1)) (or (<= ~count1~0 ~count3~0) (= ~res3~0 1)) (or (and (not (= ~res1~0 1)) (<= ~res1~0 1)) (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1))), Black: 677#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 675#(and (<= ~count1~0 ~count3~0) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0))), 548#true, Black: 665#(<= ~count1~0 ~count3~0), Black: 421#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), Black: 423#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0)) (<= ~count2~0 ~count1~0)), 4#L68-1true, Black: 552#(or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= ~res1~0 0)), 123#L88-1true, Black: 700#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0))), Black: 697#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0))), Black: 435#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 443#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 446#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count3~0 1) ~count1~0))), Black: 576#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0))), Black: 578#(and (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0)) (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0))), Black: 326#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res2~0 1) 0) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 324#(and (or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)) (or (<= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count3~0) (= ~res3~0 1))), Black: 318#(or (= (+ ~res1~0 1) 0) (<= (+ ~count2~0 1) ~count1~0)), Black: 712#(or (<= ~count2~0 ~count3~0) (= ~res3~0 1)), Black: 722#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 720#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (<= ~count2~0 ~count1~0)), Black: 711#(<= ~count2~0 ~count1~0), Black: 724#(and (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (= ~res3~0 1)) (or (<= ~count2~0 ~count3~0) (= ~res3~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= ~count2~0 ~count1~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 338#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), 316#true, 41#L123-2true, 269#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 369#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 623#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), 384#(or (<= ~count1~0 ~count3~0) (= ~res3~0 1)), Black: 361#(or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)), Black: 599#(<= ~res2~0 0), 413#(<= ~count2~0 ~count1~0), Black: 371#(and (or (= (+ ~res2~0 1) 0) (<= (+ ~count3~0 1) ~count2~0)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~res1~0 1) 0) (= ~res3~0 1)) (or (and (not (= ~res2~0 1)) (<= ~res2~0 1)) (<= (+ ~count1~0 1) ~count2~0) (= ~res3~0 1))), Black: 617#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 663#true, Black: 611#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2022-12-11 19:31:05,422 INFO L382 tUnfolder$Statistics]: this new event has 173 ancestors and is not cut-off event [2022-12-11 19:31:05,423 INFO L385 tUnfolder$Statistics]: existing Event has 173 ancestors and is not cut-off event [2022-12-11 19:31:05,423 INFO L385 tUnfolder$Statistics]: existing Event has 174 ancestors and is not cut-off event [2022-12-11 19:31:05,423 INFO L385 tUnfolder$Statistics]: existing Event has 174 ancestors and is not cut-off event [2022-12-11 19:31:05,830 INFO L130 PetriNetUnfolder]: 6031/29642 cut-off events. [2022-12-11 19:31:05,830 INFO L131 PetriNetUnfolder]: For 139025/141006 co-relation queries the response was YES. [2022-12-11 19:31:06,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80153 conditions, 29642 events. 6031/29642 cut-off events. For 139025/141006 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 437515 event pairs, 1188 based on Foata normal form. 589/28240 useless extension candidates. Maximal degree in co-relation 79234. Up to 4017 conditions per place. [2022-12-11 19:31:06,207 INFO L137 encePairwiseOnDemand]: 270/282 looper letters, 210 selfloop transitions, 85 changer transitions 8/544 dead transitions. [2022-12-11 19:31:06,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 544 transitions, 5215 flow [2022-12-11 19:31:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 19:31:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 19:31:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1972 transitions. [2022-12-11 19:31:06,209 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.77698975571316 [2022-12-11 19:31:06,209 INFO L175 Difference]: Start difference. First operand has 368 places, 437 transitions, 3506 flow. Second operand 9 states and 1972 transitions. [2022-12-11 19:31:06,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 544 transitions, 5215 flow [2022-12-11 19:31:07,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 544 transitions, 5125 flow, removed 44 selfloop flow, removed 3 redundant places. [2022-12-11 19:31:07,113 INFO L231 Difference]: Finished difference. Result has 377 places, 454 transitions, 3932 flow [2022-12-11 19:31:07,114 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3446, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3932, PETRI_PLACES=377, PETRI_TRANSITIONS=454} [2022-12-11 19:31:07,115 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 126 predicate places. [2022-12-11 19:31:07,115 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 454 transitions, 3932 flow [2022-12-11 19:31:07,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:07,116 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:31:07,116 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] [2022-12-11 19:31:07,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-11 19:31:07,116 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:31:07,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:31:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash -421154775, now seen corresponding path program 3 times [2022-12-11 19:31:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:31:07,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574993402] [2022-12-11 19:31:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:31:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:31:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:31:07,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:31:07,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:31:07,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574993402] [2022-12-11 19:31:07,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574993402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:31:07,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:31:07,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:31:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291050611] [2022-12-11 19:31:07,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:31:07,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:31:07,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:31:07,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:31:07,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:31:07,332 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:31:07,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 454 transitions, 3932 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:07,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:31:07,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:31:07,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:31:12,325 INFO L130 PetriNetUnfolder]: 6188/32380 cut-off events. [2022-12-11 19:31:12,325 INFO L131 PetriNetUnfolder]: For 167350/171105 co-relation queries the response was YES. [2022-12-11 19:31:12,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85849 conditions, 32380 events. 6188/32380 cut-off events. For 167350/171105 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 488274 event pairs, 2284 based on Foata normal form. 495/30290 useless extension candidates. Maximal degree in co-relation 84986. Up to 8020 conditions per place. [2022-12-11 19:31:12,641 INFO L137 encePairwiseOnDemand]: 271/282 looper letters, 187 selfloop transitions, 40 changer transitions 10/475 dead transitions. [2022-12-11 19:31:12,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 475 transitions, 4488 flow [2022-12-11 19:31:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-11 19:31:12,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-11 19:31:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1734 transitions. [2022-12-11 19:31:12,643 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7686170212765957 [2022-12-11 19:31:12,643 INFO L175 Difference]: Start difference. First operand has 377 places, 454 transitions, 3932 flow. Second operand 8 states and 1734 transitions. [2022-12-11 19:31:12,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 475 transitions, 4488 flow [2022-12-11 19:31:13,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 475 transitions, 4438 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-11 19:31:13,397 INFO L231 Difference]: Finished difference. Result has 382 places, 449 transitions, 3908 flow [2022-12-11 19:31:13,398 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3908, PETRI_PLACES=382, PETRI_TRANSITIONS=449} [2022-12-11 19:31:13,398 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 131 predicate places. [2022-12-11 19:31:13,398 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 449 transitions, 3908 flow [2022-12-11 19:31:13,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:13,398 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:31:13,399 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] [2022-12-11 19:31:13,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-11 19:31:13,399 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:31:13,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:31:13,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1531291925, now seen corresponding path program 4 times [2022-12-11 19:31:13,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:31:13,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631361032] [2022-12-11 19:31:13,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:31:13,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:31:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:31:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:31:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:31:13,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631361032] [2022-12-11 19:31:13,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631361032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:31:13,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:31:13,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:31:13,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849022333] [2022-12-11 19:31:13,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:31:13,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:31:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:31:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:31:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:31:13,532 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:31:13,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 449 transitions, 3908 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:13,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:31:13,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:31:13,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:31:18,333 INFO L130 PetriNetUnfolder]: 6227/32811 cut-off events. [2022-12-11 19:31:18,334 INFO L131 PetriNetUnfolder]: For 165548/168235 co-relation queries the response was YES. [2022-12-11 19:31:19,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85695 conditions, 32811 events. 6227/32811 cut-off events. For 165548/168235 co-relation queries the response was YES. Maximal size of possible extension queue 1365. Compared 495485 event pairs, 1680 based on Foata normal form. 605/30996 useless extension candidates. Maximal degree in co-relation 84890. Up to 6606 conditions per place. [2022-12-11 19:31:19,168 INFO L137 encePairwiseOnDemand]: 273/282 looper letters, 163 selfloop transitions, 72 changer transitions 11/481 dead transitions. [2022-12-11 19:31:19,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 481 transitions, 4623 flow [2022-12-11 19:31:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 19:31:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 19:31:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1529 transitions. [2022-12-11 19:31:19,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7745694022289767 [2022-12-11 19:31:19,170 INFO L175 Difference]: Start difference. First operand has 382 places, 449 transitions, 3908 flow. Second operand 7 states and 1529 transitions. [2022-12-11 19:31:19,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 481 transitions, 4623 flow [2022-12-11 19:31:20,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 481 transitions, 4503 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-11 19:31:20,017 INFO L231 Difference]: Finished difference. Result has 383 places, 443 transitions, 3851 flow [2022-12-11 19:31:20,017 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=282, PETRI_DIFFERENCE_MINUEND_FLOW=3794, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3851, PETRI_PLACES=383, PETRI_TRANSITIONS=443} [2022-12-11 19:31:20,018 INFO L295 CegarLoopForPetriNet]: 251 programPoint places, 132 predicate places. [2022-12-11 19:31:20,018 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 443 transitions, 3851 flow [2022-12-11 19:31:20,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:20,018 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:31:20,018 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] [2022-12-11 19:31:20,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-11 19:31:20,019 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:31:20,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:31:20,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1125418890, now seen corresponding path program 1 times [2022-12-11 19:31:20,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:31:20,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66053745] [2022-12-11 19:31:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:31:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:31:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:31:20,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:31:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:31:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66053745] [2022-12-11 19:31:20,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66053745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:31:20,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:31:20,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 19:31:20,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2482669] [2022-12-11 19:31:20,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:31:20,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 19:31:20,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:31:20,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 19:31:20,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 19:31:20,210 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 282 [2022-12-11 19:31:20,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 443 transitions, 3851 flow. Second operand has 7 states, 7 states have (on average 212.71428571428572) internal successors, (1489), 7 states have internal predecessors, (1489), 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:31:20,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:31:20,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 282 [2022-12-11 19:31:20,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand