/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/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:21:38,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:21:38,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:21:38,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:21:38,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:21:38,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:21:38,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:21:38,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:21:38,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:21:38,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:21:38,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:21:38,553 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:21:38,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:21:38,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:21:38,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:21:38,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:21:38,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:21:38,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:21:38,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:21:38,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:21:38,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:21:38,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:21:38,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:21:38,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:21:38,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:21:38,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:21:38,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:21:38,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:21:38,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:21:38,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:21:38,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:21:38,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:21:38,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:21:38,587 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:21:38,588 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:21:38,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:21:38,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:21:38,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:21:38,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:21:38,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:21:38,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:21:38,590 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-09-20 22:21:38,625 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:21:38,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:21:38,626 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:21:38,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:21:38,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:21:38,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:21:38,627 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:21:38,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:21:38,627 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:21:38,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:21:38,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:21:38,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:21:38,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:21:38,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:21:38,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:21:38,630 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:21:38,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:21:38,631 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-09-20 22:21:38,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:21:38,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:21:38,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:21:38,892 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:21:38,895 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:21:38,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:21:38,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4714e10/6c2a1e432f97481e993de4616479c80d/FLAG83d329003 [2022-09-20 22:21:39,424 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:21:39,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:21:39,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4714e10/6c2a1e432f97481e993de4616479c80d/FLAG83d329003 [2022-09-20 22:21:39,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d4714e10/6c2a1e432f97481e993de4616479c80d [2022-09-20 22:21:39,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:21:39,765 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:21:39,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:21:39,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:21:39,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:21:39,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:21:39" (1/1) ... [2022-09-20 22:21:39,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9d6b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:39, skipping insertion in model container [2022-09-20 22:21:39,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:21:39" (1/1) ... [2022-09-20 22:21:39,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:21:39,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:21:40,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:21:40,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:21:40,240 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:21:40,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:21:40,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:21:40,356 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:21:40,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40 WrapperNode [2022-09-20 22:21:40,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:21:40,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:21:40,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:21:40,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:21:40,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,435 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 194 [2022-09-20 22:21:40,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:21:40,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:21:40,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:21:40,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:21:40,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:21:40,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:21:40,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:21:40,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:21:40,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (1/1) ... [2022-09-20 22:21:40,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:21:40,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:21:40,536 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-09-20 22:21:40,540 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-09-20 22:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:21:40,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:21:40,568 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:21:40,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:21:40,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:21:40,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:21:40,570 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:21:40,673 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:21:40,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:21:41,194 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:21:41,550 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:21:41,551 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:21:41,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:21:41 BoogieIcfgContainer [2022-09-20 22:21:41,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:21:41,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:21:41,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:21:41,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:21:41,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:21:39" (1/3) ... [2022-09-20 22:21:41,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:21:41, skipping insertion in model container [2022-09-20 22:21:41,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:21:40" (2/3) ... [2022-09-20 22:21:41,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d7248b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:21:41, skipping insertion in model container [2022-09-20 22:21:41,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:21:41" (3/3) ... [2022-09-20 22:21:41,560 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:21:41,576 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:21:41,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:21:41,576 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:21:41,639 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:21:41,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2022-09-20 22:21:41,746 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2022-09-20 22:21:41,746 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:21:41,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 77 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-09-20 22:21:41,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2022-09-20 22:21:41,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2022-09-20 22:21:41,765 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:21:41,773 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;@20ab1ad4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:21:41,773 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:21:41,794 INFO L130 PetriNetUnfolder]: 0/51 cut-off events. [2022-09-20 22:21:41,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:21:41,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:21:41,795 INFO L208 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] [2022-09-20 22:21:41,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:21:41,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:21:41,801 INFO L85 PathProgramCache]: Analyzing trace with hash -183657469, now seen corresponding path program 1 times [2022-09-20 22:21:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:21:41,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960267616] [2022-09-20 22:21:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:21:41,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:21:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:21:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:21:42,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:21:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960267616] [2022-09-20 22:21:42,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960267616] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:21:42,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:21:42,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:21:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397525180] [2022-09-20 22:21:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:21:42,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:21:42,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:21:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:21:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:21:42,105 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 140 [2022-09-20 22:21:42,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-09-20 22:21:42,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:21:42,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 140 [2022-09-20 22:21:42,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:21:42,397 INFO L130 PetriNetUnfolder]: 162/624 cut-off events. [2022-09-20 22:21:42,397 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-09-20 22:21:42,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 624 events. 162/624 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3443 event pairs, 132 based on Foata normal form. 46/629 useless extension candidates. Maximal degree in co-relation 871. Up to 191 conditions per place. [2022-09-20 22:21:42,410 INFO L137 encePairwiseOnDemand]: 135/140 looper letters, 18 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2022-09-20 22:21:42,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 341 flow [2022-09-20 22:21:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:21:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:21:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2022-09-20 22:21:42,427 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9452380952380952 [2022-09-20 22:21:42,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2022-09-20 22:21:42,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2022-09-20 22:21:42,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:21:42,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2022-09-20 22:21:42,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 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-09-20 22:21:42,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-09-20 22:21:42,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 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-09-20 22:21:42,448 INFO L175 Difference]: Start difference. First operand has 147 places, 136 transitions, 284 flow. Second operand 3 states and 397 transitions. [2022-09-20 22:21:42,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 341 flow [2022-09-20 22:21:42,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 140 transitions, 334 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:21:42,456 INFO L231 Difference]: Finished difference. Result has 143 places, 132 transitions, 276 flow [2022-09-20 22:21:42,458 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=143, PETRI_TRANSITIONS=132} [2022-09-20 22:21:42,462 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, -4 predicate places. [2022-09-20 22:21:42,463 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 132 transitions, 276 flow [2022-09-20 22:21:42,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-09-20 22:21:42,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:21:42,463 INFO L208 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] [2022-09-20 22:21:42,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:21:42,464 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:21:42,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:21:42,465 INFO L85 PathProgramCache]: Analyzing trace with hash -342842823, now seen corresponding path program 1 times [2022-09-20 22:21:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:21:42,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051995370] [2022-09-20 22:21:42,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:21:42,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:21:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:21:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:21:42,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:21:42,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051995370] [2022-09-20 22:21:42,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051995370] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:21:42,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:21:42,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:21:42,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581750940] [2022-09-20 22:21:42,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:21:42,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:21:42,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:21:42,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:21:42,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:21:42,796 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2022-09-20 22:21:42,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:21:42,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:21:42,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2022-09-20 22:21:42,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:21:47,092 INFO L130 PetriNetUnfolder]: 11642/25737 cut-off events. [2022-09-20 22:21:47,092 INFO L131 PetriNetUnfolder]: For 757/757 co-relation queries the response was YES. [2022-09-20 22:21:47,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42665 conditions, 25737 events. 11642/25737 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 262600 event pairs, 1104 based on Foata normal form. 0/25288 useless extension candidates. Maximal degree in co-relation 42602. Up to 6770 conditions per place. [2022-09-20 22:21:47,257 INFO L137 encePairwiseOnDemand]: 128/140 looper letters, 47 selfloop transitions, 8 changer transitions 119/263 dead transitions. [2022-09-20 22:21:47,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 263 transitions, 878 flow [2022-09-20 22:21:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:21:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:21:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1542 transitions. [2022-09-20 22:21:47,262 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8472527472527472 [2022-09-20 22:21:47,262 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1542 transitions. [2022-09-20 22:21:47,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1542 transitions. [2022-09-20 22:21:47,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:21:47,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1542 transitions. [2022-09-20 22:21:47,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.61538461538461) internal successors, (1542), 13 states have internal predecessors, (1542), 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-09-20 22:21:47,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:21:47,271 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:21:47,271 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 13 states and 1542 transitions. [2022-09-20 22:21:47,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 263 transitions, 878 flow [2022-09-20 22:21:47,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 263 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:21:47,277 INFO L231 Difference]: Finished difference. Result has 165 places, 124 transitions, 358 flow [2022-09-20 22:21:47,277 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=358, PETRI_PLACES=165, PETRI_TRANSITIONS=124} [2022-09-20 22:21:47,278 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 18 predicate places. [2022-09-20 22:21:47,278 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 124 transitions, 358 flow [2022-09-20 22:21:47,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:21:47,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:21:47,279 INFO L208 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] [2022-09-20 22:21:47,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:21:47,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:21:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:21:47,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1593862378, now seen corresponding path program 1 times [2022-09-20 22:21:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:21:47,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475207679] [2022-09-20 22:21:47,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:21:47,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:21:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:21:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:21:47,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:21:47,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475207679] [2022-09-20 22:21:47,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475207679] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:21:47,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:21:47,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:21:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983539816] [2022-09-20 22:21:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:21:47,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:21:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:21:47,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:21:47,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:21:47,519 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2022-09-20 22:21:47,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 124 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 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-09-20 22:21:47,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:21:47,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2022-09-20 22:21:47,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:21:49,934 INFO L130 PetriNetUnfolder]: 7952/13598 cut-off events. [2022-09-20 22:21:49,935 INFO L131 PetriNetUnfolder]: For 27521/27533 co-relation queries the response was YES. [2022-09-20 22:21:49,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43263 conditions, 13598 events. 7952/13598 cut-off events. For 27521/27533 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 100774 event pairs, 1058 based on Foata normal form. 288/13732 useless extension candidates. Maximal degree in co-relation 43188. Up to 4651 conditions per place. [2022-09-20 22:21:50,034 INFO L137 encePairwiseOnDemand]: 126/140 looper letters, 47 selfloop transitions, 15 changer transitions 103/254 dead transitions. [2022-09-20 22:21:50,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 254 transitions, 1398 flow [2022-09-20 22:21:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:21:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:21:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-09-20 22:21:50,038 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8379120879120879 [2022-09-20 22:21:50,038 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1525 transitions. [2022-09-20 22:21:50,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1525 transitions. [2022-09-20 22:21:50,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:21:50,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1525 transitions. [2022-09-20 22:21:50,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.3076923076923) internal successors, (1525), 13 states have internal predecessors, (1525), 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-09-20 22:21:50,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:21:50,048 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:21:50,048 INFO L175 Difference]: Start difference. First operand has 165 places, 124 transitions, 358 flow. Second operand 13 states and 1525 transitions. [2022-09-20 22:21:50,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 254 transitions, 1398 flow [2022-09-20 22:21:50,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 254 transitions, 1346 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-09-20 22:21:50,183 INFO L231 Difference]: Finished difference. Result has 162 places, 133 transitions, 535 flow [2022-09-20 22:21:50,183 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=535, PETRI_PLACES=162, PETRI_TRANSITIONS=133} [2022-09-20 22:21:50,185 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 15 predicate places. [2022-09-20 22:21:50,185 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 133 transitions, 535 flow [2022-09-20 22:21:50,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 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-09-20 22:21:50,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:21:50,186 INFO L208 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] [2022-09-20 22:21:50,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:21:50,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:21:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:21:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1500496593, now seen corresponding path program 1 times [2022-09-20 22:21:50,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:21:50,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874456950] [2022-09-20 22:21:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:21:50,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:21:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:21:50,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-09-20 22:21:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:21:50,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874456950] [2022-09-20 22:21:50,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874456950] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:21:50,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:21:50,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:21:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874981551] [2022-09-20 22:21:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:21:50,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:21:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:21:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:21:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:21:50,388 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 140 [2022-09-20 22:21:50,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 133 transitions, 535 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 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-09-20 22:21:50,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:21:50,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 140 [2022-09-20 22:21:50,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:21:52,458 INFO L130 PetriNetUnfolder]: 6595/11913 cut-off events. [2022-09-20 22:21:52,458 INFO L131 PetriNetUnfolder]: For 39470/39515 co-relation queries the response was YES. [2022-09-20 22:21:52,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42018 conditions, 11913 events. 6595/11913 cut-off events. For 39470/39515 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 90321 event pairs, 2018 based on Foata normal form. 214/11796 useless extension candidates. Maximal degree in co-relation 41929. Up to 4613 conditions per place. [2022-09-20 22:21:52,583 INFO L137 encePairwiseOnDemand]: 124/140 looper letters, 45 selfloop transitions, 30 changer transitions 85/249 dead transitions. [2022-09-20 22:21:52,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 249 transitions, 1641 flow [2022-09-20 22:21:52,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:21:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:21:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-09-20 22:21:52,587 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8379120879120879 [2022-09-20 22:21:52,587 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1525 transitions. [2022-09-20 22:21:52,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1525 transitions. [2022-09-20 22:21:52,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:21:52,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1525 transitions. [2022-09-20 22:21:52,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.3076923076923) internal successors, (1525), 13 states have internal predecessors, (1525), 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-09-20 22:21:52,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:21:52,595 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:21:52,595 INFO L175 Difference]: Start difference. First operand has 162 places, 133 transitions, 535 flow. Second operand 13 states and 1525 transitions. [2022-09-20 22:21:52,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 249 transitions, 1641 flow [2022-09-20 22:21:52,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 249 transitions, 1540 flow, removed 48 selfloop flow, removed 7 redundant places. [2022-09-20 22:21:52,783 INFO L231 Difference]: Finished difference. Result has 169 places, 142 transitions, 718 flow [2022-09-20 22:21:52,783 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=718, PETRI_PLACES=169, PETRI_TRANSITIONS=142} [2022-09-20 22:21:52,785 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 22 predicate places. [2022-09-20 22:21:52,789 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 142 transitions, 718 flow [2022-09-20 22:21:52,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 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-09-20 22:21:52,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:21:52,791 INFO L208 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] [2022-09-20 22:21:52,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:21:52,791 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:21:52,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:21:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash -808140814, now seen corresponding path program 1 times [2022-09-20 22:21:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:21:52,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546393373] [2022-09-20 22:21:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:21:52,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:21:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:21:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:21:52,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:21:52,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546393373] [2022-09-20 22:21:52,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546393373] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:21:52,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:21:52,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:21:52,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338567917] [2022-09-20 22:21:52,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:21:52,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:21:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:21:52,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:21:52,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:21:52,934 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 22:21:52,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 142 transitions, 718 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-09-20 22:21:52,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:21:52,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 22:21:52,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:21:56,591 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$w_buff0_used~0_413 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd3~0_76 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_414 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_286 256) 0))) (let ((.cse4 (not .cse14)) (.cse5 (or .cse14 .cse10)) (.cse0 (not .cse13)) (.cse2 (or .cse13 .cse12)) (.cse1 (not .cse12)) (.cse7 (or .cse12 .cse8)) (.cse6 (not .cse8)) (.cse3 (not .cse10))) (and (or (and (= |v_P2Thread1of1ForFork2_#t~ite15_1| |v_P2_#t~ite15_29|) .cse0 .cse1 (= v_~a~0_132 v_~a$w_buff0~0_69)) (and (= |v_P2_#t~ite15_29| v_~a~0_132) .cse2 (or (and .cse3 .cse4 (= |v_P2_#t~ite15_29| v_~a$w_buff1~0_80)) (and .cse5 (= |v_P2_#t~ite15_29| v_~a~0_133))))) (or (and (or (and .cse3 .cse4) (and .cse1 .cse6)) (= v_~a$w_buff1_used~0_285 0)) (and .cse7 .cse5 (= v_~a$w_buff1_used~0_286 v_~a$w_buff1_used~0_285))) (or (and (= v_~a$w_buff0_used~0_413 0) .cse0 .cse1) (and .cse2 (= v_~a$w_buff0_used~0_414 v_~a$w_buff0_used~0_413))) (or (and .cse1 (= v_~a$r_buff0_thd3~0_75 0) .cse6) (and (= v_~a$r_buff0_thd3~0_76 v_~a$r_buff0_thd3~0_75) .cse7)) (let ((.cse9 (= (mod v_~a$r_buff0_thd3~0_75 256) 0)) (.cse11 (= (mod v_~a$w_buff1_used~0_285 256) 0))) (or (and (or .cse8 .cse9) (or .cse10 .cse11) (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51)) (and (or (and (not .cse9) .cse6) (and .cse3 (not .cse11))) (= v_~a$r_buff1_thd3~0_51 0))))))) InVars {~a~0=v_~a~0_133, P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_1|, ~a$w_buff1~0=v_~a$w_buff1~0_80, ~a$w_buff0~0=v_~a$w_buff0~0_69, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_414, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_76, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_286} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_413, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~a~0=v_~a~0_132, ~a$w_buff1~0=v_~a$w_buff1~0_80, ~a$w_buff0~0=v_~a$w_buff0~0_69, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_285, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_1|, P2Thread1of1ForFork2_#t~ite17=|v_P2Thread1of1ForFork2_#t~ite17_1|, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_1|, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_1|} AuxVars[|v_P2_#t~ite15_29|] AssignedVars[~a~0, P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite20, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork2_#t~ite16, P2Thread1of1ForFork2_#t~ite17, P2Thread1of1ForFork2_#t~ite18, P2Thread1of1ForFork2_#t~ite19][147], [Black: 233#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 250#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 242#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 18#L788true, Black: 244#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 238#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 252#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 232#(= ~x~0 0), 158#true, 265#true, P0Thread1of1ForFork3InUse, 194#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 214#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 210#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 206#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 216#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 212#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 110#L818true, 97#L847true, 10#L778true, Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 28#L2-1true, Black: 180#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(= ~__unbuffered_p2_EAX~0 0), 230#true, Black: 176#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 248#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 240#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)))]) [2022-09-20 22:21:56,592 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,592 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,592 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,592 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,594 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$w_buff0_used~0_413 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd3~0_76 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_414 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_286 256) 0))) (let ((.cse4 (not .cse14)) (.cse5 (or .cse14 .cse10)) (.cse0 (not .cse13)) (.cse2 (or .cse13 .cse12)) (.cse1 (not .cse12)) (.cse7 (or .cse12 .cse8)) (.cse6 (not .cse8)) (.cse3 (not .cse10))) (and (or (and (= |v_P2Thread1of1ForFork2_#t~ite15_1| |v_P2_#t~ite15_29|) .cse0 .cse1 (= v_~a~0_132 v_~a$w_buff0~0_69)) (and (= |v_P2_#t~ite15_29| v_~a~0_132) .cse2 (or (and .cse3 .cse4 (= |v_P2_#t~ite15_29| v_~a$w_buff1~0_80)) (and .cse5 (= |v_P2_#t~ite15_29| v_~a~0_133))))) (or (and (or (and .cse3 .cse4) (and .cse1 .cse6)) (= v_~a$w_buff1_used~0_285 0)) (and .cse7 .cse5 (= v_~a$w_buff1_used~0_286 v_~a$w_buff1_used~0_285))) (or (and (= v_~a$w_buff0_used~0_413 0) .cse0 .cse1) (and .cse2 (= v_~a$w_buff0_used~0_414 v_~a$w_buff0_used~0_413))) (or (and .cse1 (= v_~a$r_buff0_thd3~0_75 0) .cse6) (and (= v_~a$r_buff0_thd3~0_76 v_~a$r_buff0_thd3~0_75) .cse7)) (let ((.cse9 (= (mod v_~a$r_buff0_thd3~0_75 256) 0)) (.cse11 (= (mod v_~a$w_buff1_used~0_285 256) 0))) (or (and (or .cse8 .cse9) (or .cse10 .cse11) (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51)) (and (or (and (not .cse9) .cse6) (and .cse3 (not .cse11))) (= v_~a$r_buff1_thd3~0_51 0))))))) InVars {~a~0=v_~a~0_133, P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_1|, ~a$w_buff1~0=v_~a$w_buff1~0_80, ~a$w_buff0~0=v_~a$w_buff0~0_69, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_414, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_76, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_286} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_413, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~a~0=v_~a~0_132, ~a$w_buff1~0=v_~a$w_buff1~0_80, ~a$w_buff0~0=v_~a$w_buff0~0_69, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_285, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_1|, P2Thread1of1ForFork2_#t~ite17=|v_P2Thread1of1ForFork2_#t~ite17_1|, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_1|, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_1|} AuxVars[|v_P2_#t~ite15_29|] AssignedVars[~a~0, P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite20, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork2_#t~ite16, P2Thread1of1ForFork2_#t~ite17, P2Thread1of1ForFork2_#t~ite18, P2Thread1of1ForFork2_#t~ite19][203], [Black: 233#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 250#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 242#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 18#L788true, Black: 244#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 238#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 252#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 232#(= ~x~0 0), 158#true, P0Thread1of1ForFork3InUse, 194#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 138#L3-1true, P1Thread1of1ForFork1InUse, Black: 214#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 210#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 270#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 206#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 216#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 212#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 110#L818true, 97#L847true, 10#L778true, Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(= ~__unbuffered_p2_EAX~0 0), 230#true, Black: 248#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 240#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)))]) [2022-09-20 22:21:56,594 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,594 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,594 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:21:56,594 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:21:57,030 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1132] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$w_buff0_used~0_413 256) 0)) (.cse12 (= (mod v_~a$r_buff0_thd3~0_76 256) 0)) (.cse13 (= (mod v_~a$w_buff0_used~0_414 256) 0)) (.cse10 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_286 256) 0))) (let ((.cse4 (not .cse14)) (.cse5 (or .cse14 .cse10)) (.cse0 (not .cse13)) (.cse2 (or .cse13 .cse12)) (.cse1 (not .cse12)) (.cse7 (or .cse12 .cse8)) (.cse6 (not .cse8)) (.cse3 (not .cse10))) (and (or (and (= |v_P2Thread1of1ForFork2_#t~ite15_1| |v_P2_#t~ite15_29|) .cse0 .cse1 (= v_~a~0_132 v_~a$w_buff0~0_69)) (and (= |v_P2_#t~ite15_29| v_~a~0_132) .cse2 (or (and .cse3 .cse4 (= |v_P2_#t~ite15_29| v_~a$w_buff1~0_80)) (and .cse5 (= |v_P2_#t~ite15_29| v_~a~0_133))))) (or (and (or (and .cse3 .cse4) (and .cse1 .cse6)) (= v_~a$w_buff1_used~0_285 0)) (and .cse7 .cse5 (= v_~a$w_buff1_used~0_286 v_~a$w_buff1_used~0_285))) (or (and (= v_~a$w_buff0_used~0_413 0) .cse0 .cse1) (and .cse2 (= v_~a$w_buff0_used~0_414 v_~a$w_buff0_used~0_413))) (or (and .cse1 (= v_~a$r_buff0_thd3~0_75 0) .cse6) (and (= v_~a$r_buff0_thd3~0_76 v_~a$r_buff0_thd3~0_75) .cse7)) (let ((.cse9 (= (mod v_~a$r_buff0_thd3~0_75 256) 0)) (.cse11 (= (mod v_~a$w_buff1_used~0_285 256) 0))) (or (and (or .cse8 .cse9) (or .cse10 .cse11) (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51)) (and (or (and (not .cse9) .cse6) (and .cse3 (not .cse11))) (= v_~a$r_buff1_thd3~0_51 0))))))) InVars {~a~0=v_~a~0_133, P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_1|, ~a$w_buff1~0=v_~a$w_buff1~0_80, ~a$w_buff0~0=v_~a$w_buff0~0_69, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_414, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_76, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_286} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_413, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~a~0=v_~a~0_132, ~a$w_buff1~0=v_~a$w_buff1~0_80, ~a$w_buff0~0=v_~a$w_buff0~0_69, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_1|, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_285, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_1|, P2Thread1of1ForFork2_#t~ite17=|v_P2Thread1of1ForFork2_#t~ite17_1|, P2Thread1of1ForFork2_#t~ite18=|v_P2Thread1of1ForFork2_#t~ite18_1|, P2Thread1of1ForFork2_#t~ite19=|v_P2Thread1of1ForFork2_#t~ite19_1|} AuxVars[|v_P2_#t~ite15_29|] AssignedVars[~a~0, P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite20, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0, P2Thread1of1ForFork2_#t~ite16, P2Thread1of1ForFork2_#t~ite17, P2Thread1of1ForFork2_#t~ite18, P2Thread1of1ForFork2_#t~ite19][147], [Black: 233#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 250#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 242#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 18#L788true, Black: 244#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 238#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 252#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 232#(= ~x~0 0), 158#true, 265#true, P0Thread1of1ForFork3InUse, 194#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 214#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 210#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 206#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 216#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 212#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 110#L818true, 97#L847true, 10#L778true, Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 11#L889true, Black: 160#(= ~__unbuffered_p2_EAX~0 0), 230#true, Black: 248#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 240#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)))]) [2022-09-20 22:21:57,031 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,031 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,031 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,031 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_2 0) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1) (= v_~__unbuffered_p2_EAX~0_2 1) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][213], [Black: 233#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 178#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 250#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 242#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 244#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 18#L788true, Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 238#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 246#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 252#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 232#(= ~x~0 0), 158#true, 265#true, P0Thread1of1ForFork3InUse, 194#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 214#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 210#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 198#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 206#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 216#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 196#(= ~__unbuffered_p3_EAX~0 0), Black: 197#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 212#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), 122#L892true, 100#L811true, 97#L847true, 10#L778true, Black: 161#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 180#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 160#(= ~__unbuffered_p2_EAX~0 0), 230#true, Black: 248#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 176#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)))), Black: 240#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)))]) [2022-09-20 22:21:57,034 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,034 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,034 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,034 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:21:57,943 INFO L130 PetriNetUnfolder]: 18191/32519 cut-off events. [2022-09-20 22:21:57,943 INFO L131 PetriNetUnfolder]: For 52793/59899 co-relation queries the response was YES. [2022-09-20 22:21:58,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81775 conditions, 32519 events. 18191/32519 cut-off events. For 52793/59899 co-relation queries the response was YES. Maximal size of possible extension queue 1843. Compared 299090 event pairs, 2375 based on Foata normal form. 256/30889 useless extension candidates. Maximal degree in co-relation 81679. Up to 9750 conditions per place. [2022-09-20 22:21:58,375 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 101 selfloop transitions, 20 changer transitions 0/238 dead transitions. [2022-09-20 22:21:58,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 238 transitions, 1410 flow [2022-09-20 22:21:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:21:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:21:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1237 transitions. [2022-09-20 22:21:58,379 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8835714285714286 [2022-09-20 22:21:58,379 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1237 transitions. [2022-09-20 22:21:58,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1237 transitions. [2022-09-20 22:21:58,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:21:58,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1237 transitions. [2022-09-20 22:21:58,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 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-09-20 22:21:58,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-09-20 22:21:58,385 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 140.0) internal successors, (1540), 11 states have internal predecessors, (1540), 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-09-20 22:21:58,385 INFO L175 Difference]: Start difference. First operand has 169 places, 142 transitions, 718 flow. Second operand 10 states and 1237 transitions. [2022-09-20 22:21:58,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 238 transitions, 1410 flow [2022-09-20 22:21:58,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 238 transitions, 1362 flow, removed 24 selfloop flow, removed 15 redundant places. [2022-09-20 22:21:58,685 INFO L231 Difference]: Finished difference. Result has 160 places, 160 transitions, 813 flow [2022-09-20 22:21:58,685 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=813, PETRI_PLACES=160, PETRI_TRANSITIONS=160} [2022-09-20 22:21:58,688 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2022-09-20 22:21:58,688 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 160 transitions, 813 flow [2022-09-20 22:21:58,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 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-09-20 22:21:58,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:21:58,688 INFO L208 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] [2022-09-20 22:21:58,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:21:58,689 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:21:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:21:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1000412238, now seen corresponding path program 1 times [2022-09-20 22:21:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:21:58,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920066431] [2022-09-20 22:21:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:21:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:21:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:21:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:21:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:21:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920066431] [2022-09-20 22:21:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920066431] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:21:58,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:21:58,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:21:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037029260] [2022-09-20 22:21:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:21:58,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:21:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:21:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:21:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:21:58,840 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 140 [2022-09-20 22:21:58,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 160 transitions, 813 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-09-20 22:21:58,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:21:58,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 140 [2022-09-20 22:21:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:01,502 INFO L130 PetriNetUnfolder]: 6690/18329 cut-off events. [2022-09-20 22:22:01,502 INFO L131 PetriNetUnfolder]: For 33686/36781 co-relation queries the response was YES. [2022-09-20 22:22:01,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52139 conditions, 18329 events. 6690/18329 cut-off events. For 33686/36781 co-relation queries the response was YES. Maximal size of possible extension queue 1198. Compared 216183 event pairs, 2851 based on Foata normal form. 353/17369 useless extension candidates. Maximal degree in co-relation 52049. Up to 3157 conditions per place. [2022-09-20 22:22:01,733 INFO L137 encePairwiseOnDemand]: 134/140 looper letters, 66 selfloop transitions, 21 changer transitions 0/213 dead transitions. [2022-09-20 22:22:01,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 213 transitions, 1227 flow [2022-09-20 22:22:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:22:01,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:22:01,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1111 transitions. [2022-09-20 22:22:01,736 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8817460317460317 [2022-09-20 22:22:01,736 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1111 transitions. [2022-09-20 22:22:01,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1111 transitions. [2022-09-20 22:22:01,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:01,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1111 transitions. [2022-09-20 22:22:01,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.44444444444444) internal successors, (1111), 9 states have internal predecessors, (1111), 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-09-20 22:22:01,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 22:22:01,742 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 22:22:01,742 INFO L175 Difference]: Start difference. First operand has 160 places, 160 transitions, 813 flow. Second operand 9 states and 1111 transitions. [2022-09-20 22:22:01,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 213 transitions, 1227 flow [2022-09-20 22:22:01,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 213 transitions, 1225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:22:01,920 INFO L231 Difference]: Finished difference. Result has 174 places, 168 transitions, 964 flow [2022-09-20 22:22:01,921 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=964, PETRI_PLACES=174, PETRI_TRANSITIONS=168} [2022-09-20 22:22:01,923 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 27 predicate places. [2022-09-20 22:22:01,923 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 168 transitions, 964 flow [2022-09-20 22:22:01,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-09-20 22:22:01,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:01,924 INFO L208 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] [2022-09-20 22:22:01,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:22:01,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:22:01,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash -348435128, now seen corresponding path program 1 times [2022-09-20 22:22:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:01,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435367221] [2022-09-20 22:22:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:02,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:02,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435367221] [2022-09-20 22:22:02,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435367221] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:02,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:02,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:22:02,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419357143] [2022-09-20 22:22:02,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:02,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:22:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:22:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:22:02,060 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 22:22:02,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 168 transitions, 964 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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-09-20 22:22:02,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:02,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 22:22:02,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:09,010 INFO L130 PetriNetUnfolder]: 22572/41832 cut-off events. [2022-09-20 22:22:09,011 INFO L131 PetriNetUnfolder]: For 94764/103039 co-relation queries the response was YES. [2022-09-20 22:22:09,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134772 conditions, 41832 events. 22572/41832 cut-off events. For 94764/103039 co-relation queries the response was YES. Maximal size of possible extension queue 2555. Compared 417009 event pairs, 1572 based on Foata normal form. 975/41379 useless extension candidates. Maximal degree in co-relation 134675. Up to 8403 conditions per place. [2022-09-20 22:22:09,421 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 127 selfloop transitions, 38 changer transitions 5/295 dead transitions. [2022-09-20 22:22:09,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 295 transitions, 2124 flow [2022-09-20 22:22:09,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:22:09,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:22:09,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1613 transitions. [2022-09-20 22:22:09,426 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8862637362637362 [2022-09-20 22:22:09,426 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1613 transitions. [2022-09-20 22:22:09,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1613 transitions. [2022-09-20 22:22:09,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:09,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1613 transitions. [2022-09-20 22:22:09,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 124.07692307692308) internal successors, (1613), 13 states have internal predecessors, (1613), 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-09-20 22:22:09,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:22:09,436 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 140.0) internal successors, (1960), 14 states have internal predecessors, (1960), 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-09-20 22:22:09,436 INFO L175 Difference]: Start difference. First operand has 174 places, 168 transitions, 964 flow. Second operand 13 states and 1613 transitions. [2022-09-20 22:22:09,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 295 transitions, 2124 flow [2022-09-20 22:22:10,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 295 transitions, 2103 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-09-20 22:22:10,181 INFO L231 Difference]: Finished difference. Result has 191 places, 188 transitions, 1236 flow [2022-09-20 22:22:10,181 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1236, PETRI_PLACES=191, PETRI_TRANSITIONS=188} [2022-09-20 22:22:10,182 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 44 predicate places. [2022-09-20 22:22:10,182 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 188 transitions, 1236 flow [2022-09-20 22:22:10,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 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-09-20 22:22:10,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:10,182 INFO L208 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] [2022-09-20 22:22:10,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:22:10,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:22:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:10,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1254759628, now seen corresponding path program 1 times [2022-09-20 22:22:10,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:10,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905026414] [2022-09-20 22:22:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:10,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:10,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905026414] [2022-09-20 22:22:10,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905026414] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:10,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:10,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:22:10,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153118308] [2022-09-20 22:22:10,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:10,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:22:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:10,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:22:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:22:10,331 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2022-09-20 22:22:10,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 188 transitions, 1236 flow. Second operand has 7 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 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-09-20 22:22:10,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:10,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2022-09-20 22:22:10,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:14,639 INFO L130 PetriNetUnfolder]: 7938/23407 cut-off events. [2022-09-20 22:22:14,640 INFO L131 PetriNetUnfolder]: For 91540/113127 co-relation queries the response was YES. [2022-09-20 22:22:14,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86654 conditions, 23407 events. 7938/23407 cut-off events. For 91540/113127 co-relation queries the response was YES. Maximal size of possible extension queue 2340. Compared 306321 event pairs, 643 based on Foata normal form. 458/22518 useless extension candidates. Maximal degree in co-relation 86543. Up to 4970 conditions per place. [2022-09-20 22:22:14,917 INFO L137 encePairwiseOnDemand]: 123/140 looper letters, 109 selfloop transitions, 73 changer transitions 12/319 dead transitions. [2022-09-20 22:22:14,917 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 319 transitions, 2714 flow [2022-09-20 22:22:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 22:22:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 22:22:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1278 transitions. [2022-09-20 22:22:14,921 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8298701298701299 [2022-09-20 22:22:14,921 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1278 transitions. [2022-09-20 22:22:14,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1278 transitions. [2022-09-20 22:22:14,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:14,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1278 transitions. [2022-09-20 22:22:14,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 116.18181818181819) internal successors, (1278), 11 states have internal predecessors, (1278), 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-09-20 22:22:14,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-09-20 22:22:14,927 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 140.0) internal successors, (1680), 12 states have internal predecessors, (1680), 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-09-20 22:22:14,927 INFO L175 Difference]: Start difference. First operand has 191 places, 188 transitions, 1236 flow. Second operand 11 states and 1278 transitions. [2022-09-20 22:22:14,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 319 transitions, 2714 flow [2022-09-20 22:22:17,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 319 transitions, 2619 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-09-20 22:22:17,676 INFO L231 Difference]: Finished difference. Result has 206 places, 238 transitions, 2109 flow [2022-09-20 22:22:17,677 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2109, PETRI_PLACES=206, PETRI_TRANSITIONS=238} [2022-09-20 22:22:17,677 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 59 predicate places. [2022-09-20 22:22:17,677 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 238 transitions, 2109 flow [2022-09-20 22:22:17,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 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-09-20 22:22:17,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:17,678 INFO L208 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] [2022-09-20 22:22:17,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:22:17,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:22:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1959891934, now seen corresponding path program 2 times [2022-09-20 22:22:17,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:17,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392343754] [2022-09-20 22:22:17,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:17,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:17,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392343754] [2022-09-20 22:22:17,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392343754] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:17,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:17,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:22:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845059095] [2022-09-20 22:22:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:17,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:22:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:22:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:22:17,776 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 22:22:17,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 238 transitions, 2109 flow. Second operand has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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-09-20 22:22:17,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:17,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 22:22:17,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:30,077 INFO L130 PetriNetUnfolder]: 32771/59447 cut-off events. [2022-09-20 22:22:30,077 INFO L131 PetriNetUnfolder]: For 279641/308003 co-relation queries the response was YES. [2022-09-20 22:22:30,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224672 conditions, 59447 events. 32771/59447 cut-off events. For 279641/308003 co-relation queries the response was YES. Maximal size of possible extension queue 3943. Compared 615848 event pairs, 1835 based on Foata normal form. 1352/58595 useless extension candidates. Maximal degree in co-relation 224552. Up to 7457 conditions per place. [2022-09-20 22:22:31,186 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 134 selfloop transitions, 58 changer transitions 64/398 dead transitions. [2022-09-20 22:22:31,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 398 transitions, 3967 flow [2022-09-20 22:22:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:22:31,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:22:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1988 transitions. [2022-09-20 22:22:31,190 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8875 [2022-09-20 22:22:31,190 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1988 transitions. [2022-09-20 22:22:31,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1988 transitions. [2022-09-20 22:22:31,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:31,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1988 transitions. [2022-09-20 22:22:31,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 124.25) internal successors, (1988), 16 states have internal predecessors, (1988), 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-09-20 22:22:31,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-09-20 22:22:31,200 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 140.0) internal successors, (2380), 17 states have internal predecessors, (2380), 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-09-20 22:22:31,200 INFO L175 Difference]: Start difference. First operand has 206 places, 238 transitions, 2109 flow. Second operand 16 states and 1988 transitions. [2022-09-20 22:22:31,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 398 transitions, 3967 flow [2022-09-20 22:22:40,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 398 transitions, 3868 flow, removed 44 selfloop flow, removed 1 redundant places. [2022-09-20 22:22:40,455 INFO L231 Difference]: Finished difference. Result has 224 places, 232 transitions, 2026 flow [2022-09-20 22:22:40,455 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2026, PETRI_PLACES=224, PETRI_TRANSITIONS=232} [2022-09-20 22:22:40,456 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 77 predicate places. [2022-09-20 22:22:40,456 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 232 transitions, 2026 flow [2022-09-20 22:22:40,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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-09-20 22:22:40,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:22:40,456 INFO L208 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] [2022-09-20 22:22:40,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:22:40,457 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:22:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:22:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash 818807538, now seen corresponding path program 1 times [2022-09-20 22:22:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:22:40,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893943956] [2022-09-20 22:22:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:22:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:22:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:22:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:22:40,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:22:40,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893943956] [2022-09-20 22:22:40,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893943956] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:22:40,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:22:40,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:22:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291356915] [2022-09-20 22:22:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:22:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:22:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:22:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:22:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:22:40,586 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 140 [2022-09-20 22:22:40,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 232 transitions, 2026 flow. Second operand has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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-09-20 22:22:40,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:22:40,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 140 [2022-09-20 22:22:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:22:51,961 INFO L130 PetriNetUnfolder]: 32333/58482 cut-off events. [2022-09-20 22:22:51,961 INFO L131 PetriNetUnfolder]: For 331667/359496 co-relation queries the response was YES. [2022-09-20 22:22:52,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241261 conditions, 58482 events. 32333/58482 cut-off events. For 331667/359496 co-relation queries the response was YES. Maximal size of possible extension queue 3943. Compared 607808 event pairs, 1789 based on Foata normal form. 1032/57314 useless extension candidates. Maximal degree in co-relation 241208. Up to 7220 conditions per place. [2022-09-20 22:22:53,011 INFO L137 encePairwiseOnDemand]: 129/140 looper letters, 117 selfloop transitions, 63 changer transitions 50/369 dead transitions. [2022-09-20 22:22:53,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 369 transitions, 3676 flow [2022-09-20 22:22:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 22:22:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 22:22:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2312 transitions. [2022-09-20 22:22:53,020 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.869172932330827 [2022-09-20 22:22:53,020 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2312 transitions. [2022-09-20 22:22:53,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2312 transitions. [2022-09-20 22:22:53,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:22:53,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2312 transitions. [2022-09-20 22:22:53,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 121.6842105263158) internal successors, (2312), 19 states have internal predecessors, (2312), 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-09-20 22:22:53,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 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-09-20 22:22:53,045 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 140.0) internal successors, (2800), 20 states have internal predecessors, (2800), 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-09-20 22:22:53,045 INFO L175 Difference]: Start difference. First operand has 224 places, 232 transitions, 2026 flow. Second operand 19 states and 2312 transitions. [2022-09-20 22:22:53,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 369 transitions, 3676 flow [2022-09-20 22:23:12,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 369 transitions, 3057 flow, removed 261 selfloop flow, removed 22 redundant places. [2022-09-20 22:23:12,819 INFO L231 Difference]: Finished difference. Result has 218 places, 228 transitions, 1742 flow [2022-09-20 22:23:12,820 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1742, PETRI_PLACES=218, PETRI_TRANSITIONS=228} [2022-09-20 22:23:12,820 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 71 predicate places. [2022-09-20 22:23:12,820 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 228 transitions, 1742 flow [2022-09-20 22:23:12,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.11111111111111) internal successors, (1036), 9 states have internal predecessors, (1036), 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-09-20 22:23:12,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:12,821 INFO L208 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] [2022-09-20 22:23:12,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:23:12,821 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:23:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:12,822 INFO L85 PathProgramCache]: Analyzing trace with hash -677764427, now seen corresponding path program 1 times [2022-09-20 22:23:12,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:12,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955772368] [2022-09-20 22:23:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:12,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:12,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955772368] [2022-09-20 22:23:12,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955772368] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:12,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:12,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:23:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268463148] [2022-09-20 22:23:12,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:12,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:23:12,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:12,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:23:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:23:12,986 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2022-09-20 22:23:12,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 228 transitions, 1742 flow. Second operand has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 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-09-20 22:23:12,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:12,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2022-09-20 22:23:12,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:18,440 INFO L130 PetriNetUnfolder]: 11602/36975 cut-off events. [2022-09-20 22:23:18,440 INFO L131 PetriNetUnfolder]: For 104521/108536 co-relation queries the response was YES. [2022-09-20 22:23:18,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125384 conditions, 36975 events. 11602/36975 cut-off events. For 104521/108536 co-relation queries the response was YES. Maximal size of possible extension queue 4619. Compared 568075 event pairs, 374 based on Foata normal form. 8/34309 useless extension candidates. Maximal degree in co-relation 125259. Up to 3317 conditions per place. [2022-09-20 22:23:18,955 INFO L137 encePairwiseOnDemand]: 123/140 looper letters, 64 selfloop transitions, 46 changer transitions 45/306 dead transitions. [2022-09-20 22:23:18,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 306 transitions, 2839 flow [2022-09-20 22:23:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:23:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:23:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1020 transitions. [2022-09-20 22:23:18,957 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2022-09-20 22:23:18,957 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1020 transitions. [2022-09-20 22:23:18,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1020 transitions. [2022-09-20 22:23:18,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:18,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1020 transitions. [2022-09-20 22:23:18,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.33333333333333) internal successors, (1020), 9 states have internal predecessors, (1020), 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-09-20 22:23:18,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 22:23:18,961 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 140.0) internal successors, (1400), 10 states have internal predecessors, (1400), 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-09-20 22:23:18,961 INFO L175 Difference]: Start difference. First operand has 218 places, 228 transitions, 1742 flow. Second operand 9 states and 1020 transitions. [2022-09-20 22:23:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 306 transitions, 2839 flow [2022-09-20 22:23:27,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 306 transitions, 2629 flow, removed 57 selfloop flow, removed 17 redundant places. [2022-09-20 22:23:27,961 INFO L231 Difference]: Finished difference. Result has 210 places, 228 transitions, 1744 flow [2022-09-20 22:23:27,961 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1744, PETRI_PLACES=210, PETRI_TRANSITIONS=228} [2022-09-20 22:23:27,962 INFO L287 CegarLoopForPetriNet]: 147 programPoint places, 63 predicate places. [2022-09-20 22:23:27,962 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 228 transitions, 1744 flow [2022-09-20 22:23:27,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 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-09-20 22:23:27,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:23:27,962 INFO L208 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] [2022-09-20 22:23:27,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:23:27,962 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:23:27,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:23:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1189613867, now seen corresponding path program 2 times [2022-09-20 22:23:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:23:27,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53270468] [2022-09-20 22:23:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:23:27,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:23:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:23:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:23:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:23:28,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53270468] [2022-09-20 22:23:28,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53270468] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:23:28,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:23:28,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-09-20 22:23:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000957424] [2022-09-20 22:23:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:23:28,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-09-20 22:23:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:23:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-09-20 22:23:28,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-09-20 22:23:28,315 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2022-09-20 22:23:28,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 228 transitions, 1744 flow. Second operand has 13 states, 13 states have (on average 99.0) internal successors, (1287), 13 states have internal predecessors, (1287), 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-09-20 22:23:28,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:23:28,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2022-09-20 22:23:28,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:23:33,470 INFO L130 PetriNetUnfolder]: 9913/31719 cut-off events. [2022-09-20 22:23:33,470 INFO L131 PetriNetUnfolder]: For 62980/63990 co-relation queries the response was YES. [2022-09-20 22:23:33,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93842 conditions, 31719 events. 9913/31719 cut-off events. For 62980/63990 co-relation queries the response was YES. Maximal size of possible extension queue 3890. Compared 480313 event pairs, 541 based on Foata normal form. 11/29789 useless extension candidates. Maximal degree in co-relation 93799. Up to 3201 conditions per place. [2022-09-20 22:23:33,957 INFO L137 encePairwiseOnDemand]: 118/140 looper letters, 59 selfloop transitions, 52 changer transitions 62/317 dead transitions. [2022-09-20 22:23:33,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 317 transitions, 3083 flow [2022-09-20 22:23:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:23:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:23:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1442 transitions. [2022-09-20 22:23:33,959 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7357142857142858 [2022-09-20 22:23:33,959 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1442 transitions. [2022-09-20 22:23:33,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1442 transitions. [2022-09-20 22:23:33,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:23:33,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1442 transitions. [2022-09-20 22:23:33,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 103.0) internal successors, (1442), 14 states have internal predecessors, (1442), 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-09-20 22:23:33,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 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-09-20 22:23:33,964 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 140.0) internal successors, (2100), 15 states have internal predecessors, (2100), 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-09-20 22:23:33,964 INFO L175 Difference]: Start difference. First operand has 210 places, 228 transitions, 1744 flow. Second operand 14 states and 1442 transitions. [2022-09-20 22:23:33,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 317 transitions, 3083 flow