./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix021.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:46:01,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:46:01,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:46:01,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:46:01,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:46:01,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:46:01,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:46:01,576 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:46:01,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:46:01,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:46:01,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:46:01,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:46:01,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:46:01,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:46:01,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:46:01,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:46:01,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:46:01,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:46:01,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:46:01,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:46:01,607 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:46:01,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:46:01,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:46:01,612 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:46:01,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:46:01,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:46:01,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:46:01,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:46:01,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:46:01,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:46:01,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:46:01,627 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:46:01,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:46:01,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:46:01,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:46:01,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:46:01,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:46:01,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:46:01,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:46:01,632 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:46:01,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:46:01,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:46:01,666 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:46:01,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:46:01,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:46:01,668 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:46:01,668 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:46:01,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:46:01,669 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:46:01,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:46:01,670 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:46:01,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:46:01,671 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:46:01,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:46:01,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:46:01,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:46:01,672 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:46:01,672 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:46:01,672 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:46:01,672 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:46:01,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:46:01,673 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:46:01,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:46:01,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:46:01,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:46:01,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:46:01,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:46:01,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:46:01,677 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:46:01,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:46:01,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:46:01,678 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 576d0750cd121d18ae295ddde1dd1649436f79f5ff3834655e4b6c15fd1260db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:46:01,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:46:02,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:46:02,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:46:02,012 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:46:02,012 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:46:02,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021.opt.i [2023-09-01 09:46:03,282 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:46:03,598 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:46:03,599 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021.opt.i [2023-09-01 09:46:03,631 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fcc5952/cdfdb56678f64706896e4c693d31a83c/FLAG054816e0b [2023-09-01 09:46:03,650 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fcc5952/cdfdb56678f64706896e4c693d31a83c [2023-09-01 09:46:03,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:46:03,653 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:46:03,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:46:03,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:46:03,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:46:03,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:46:03" (1/1) ... [2023-09-01 09:46:03,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2354f153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:03, skipping insertion in model container [2023-09-01 09:46:03,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:46:03" (1/1) ... [2023-09-01 09:46:03,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:46:03,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:46:03,889 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021.opt.i[944,957] [2023-09-01 09:46:04,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:46:04,116 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:46:04,126 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021.opt.i[944,957] [2023-09-01 09:46:04,202 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:46:04,255 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:46:04,256 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:46:04,260 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:46:04,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04 WrapperNode [2023-09-01 09:46:04,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:46:04,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:46:04,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:46:04,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:46:04,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,303 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2023-09-01 09:46:04,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:46:04,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:46:04,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:46:04,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:46:04,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,328 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:46:04,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:46:04,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:46:04,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:46:04,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (1/1) ... [2023-09-01 09:46:04,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:46:04,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:46:04,374 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) [2023-09-01 09:46:04,398 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 [2023-09-01 09:46:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:46:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:46:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:46:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:46:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:46:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:46:04,412 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:46:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:46:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:46:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:46:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:46:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:46:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:46:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:46:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:46:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:46:04,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:46:04,415 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:46:04,609 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:46:04,611 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:46:04,929 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:46:05,025 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:46:05,025 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:46:05,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:05 BoogieIcfgContainer [2023-09-01 09:46:05,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:46:05,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:46:05,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:46:05,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:46:05,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:46:03" (1/3) ... [2023-09-01 09:46:05,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356be931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:46:05, skipping insertion in model container [2023-09-01 09:46:05,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:46:04" (2/3) ... [2023-09-01 09:46:05,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@356be931 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:46:05, skipping insertion in model container [2023-09-01 09:46:05,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:05" (3/3) ... [2023-09-01 09:46:05,034 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2023-09-01 09:46:05,041 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:46:05,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:46:05,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:46:05,051 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:46:05,103 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:46:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2023-09-01 09:46:05,178 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-09-01 09:46:05,178 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:05,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-09-01 09:46:05,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 127 transitions, 274 flow [2023-09-01 09:46:05,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 123 transitions, 258 flow [2023-09-01 09:46:05,190 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:46:05,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 123 transitions, 258 flow [2023-09-01 09:46:05,200 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 123 transitions, 258 flow [2023-09-01 09:46:05,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 123 transitions, 258 flow [2023-09-01 09:46:05,224 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2023-09-01 09:46:05,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:05,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-09-01 09:46:05,227 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-09-01 09:46:09,066 INFO L134 LiptonReduction]: Checked pairs total: 6374 [2023-09-01 09:46:09,067 INFO L136 LiptonReduction]: Total number of compositions: 106 [2023-09-01 09:46:09,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:46:09,091 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=true, 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;@750167b2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:46:09,091 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:46:09,096 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-09-01 09:46:09,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:46:09,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:09,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:09,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:09,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:09,102 INFO L85 PathProgramCache]: Analyzing trace with hash 618023428, now seen corresponding path program 1 times [2023-09-01 09:46:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414921045] [2023-09-01 09:46:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:09,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414921045] [2023-09-01 09:46:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414921045] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:09,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:09,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692969475] [2023-09-01 09:46:09,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:09,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:09,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 233 [2023-09-01 09:46:09,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:09,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:09,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 233 [2023-09-01 09:46:09,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:10,080 INFO L130 PetriNetUnfolder]: 2594/3775 cut-off events. [2023-09-01 09:46:10,081 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-09-01 09:46:10,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3775 events. 2594/3775 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19686 event pairs, 518 based on Foata normal form. 0/3591 useless extension candidates. Maximal degree in co-relation 7458. Up to 2797 conditions per place. [2023-09-01 09:46:10,105 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-09-01 09:46:10,105 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-09-01 09:46:10,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:10,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-09-01 09:46:10,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5379113018597997 [2023-09-01 09:46:10,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-09-01 09:46:10,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-09-01 09:46:10,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:10,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-09-01 09:46:10,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:10,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:10,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:10,140 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 376 transitions. [2023-09-01 09:46:10,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-09-01 09:46:10,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:46:10,146 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-09-01 09:46:10,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-09-01 09:46:10,151 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-09-01 09:46:10,152 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-09-01 09:46:10,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:10,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:10,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:10,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:46:10,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:10,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1215107113, now seen corresponding path program 1 times [2023-09-01 09:46:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:10,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887412996] [2023-09-01 09:46:10,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:10,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:10,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887412996] [2023-09-01 09:46:10,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887412996] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:10,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:10,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:46:10,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907777969] [2023-09-01 09:46:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:10,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:46:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:10,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:46:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:46:10,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-09-01 09:46:10,589 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:10,589 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:10,589 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-09-01 09:46:10,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:11,620 INFO L130 PetriNetUnfolder]: 7369/10218 cut-off events. [2023-09-01 09:46:11,621 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2023-09-01 09:46:11,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21094 conditions, 10218 events. 7369/10218 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 50799 event pairs, 2585 based on Foata normal form. 292/10510 useless extension candidates. Maximal degree in co-relation 21084. Up to 6285 conditions per place. [2023-09-01 09:46:11,680 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2023-09-01 09:46:11,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-09-01 09:46:11,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:46:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:46:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-09-01 09:46:11,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5121602288984263 [2023-09-01 09:46:11,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-09-01 09:46:11,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-09-01 09:46:11,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:11,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-09-01 09:46:11,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:11,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:11,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:11,688 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 358 transitions. [2023-09-01 09:46:11,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-09-01 09:46:11,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:11,699 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 120 flow [2023-09-01 09:46:11,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-09-01 09:46:11,700 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-09-01 09:46:11,701 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 120 flow [2023-09-01 09:46:11,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:11,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:11,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:11,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:46:11,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:11,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash -986387348, now seen corresponding path program 1 times [2023-09-01 09:46:11,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:11,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180830755] [2023-09-01 09:46:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:11,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180830755] [2023-09-01 09:46:11,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180830755] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:11,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:46:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465455781] [2023-09-01 09:46:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:11,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:11,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:12,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-09-01 09:46:12,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:12,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:12,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-09-01 09:46:12,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:12,983 INFO L130 PetriNetUnfolder]: 7109/9866 cut-off events. [2023-09-01 09:46:12,983 INFO L131 PetriNetUnfolder]: For 3993/3993 co-relation queries the response was YES. [2023-09-01 09:46:12,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26108 conditions, 9866 events. 7109/9866 cut-off events. For 3993/3993 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 50502 event pairs, 655 based on Foata normal form. 40/9906 useless extension candidates. Maximal degree in co-relation 26096. Up to 5657 conditions per place. [2023-09-01 09:46:13,048 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 54 selfloop transitions, 12 changer transitions 0/66 dead transitions. [2023-09-01 09:46:13,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 362 flow [2023-09-01 09:46:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-09-01 09:46:13,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5118025751072961 [2023-09-01 09:46:13,051 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-09-01 09:46:13,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-09-01 09:46:13,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:13,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-09-01 09:46:13,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:13,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:13,055 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:13,055 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 120 flow. Second operand 4 states and 477 transitions. [2023-09-01 09:46:13,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 362 flow [2023-09-01 09:46:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:13,073 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 198 flow [2023-09-01 09:46:13,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-09-01 09:46:13,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-09-01 09:46:13,077 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 198 flow [2023-09-01 09:46:13,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:13,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:13,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:13,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:46:13,078 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:13,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash -986386387, now seen corresponding path program 1 times [2023-09-01 09:46:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850330950] [2023-09-01 09:46:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:13,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850330950] [2023-09-01 09:46:13,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850330950] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:13,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:13,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:46:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687637286] [2023-09-01 09:46:13,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:13,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:13,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:13,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:13,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-09-01 09:46:13,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:13,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:13,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-09-01 09:46:13,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:14,348 INFO L130 PetriNetUnfolder]: 6661/9250 cut-off events. [2023-09-01 09:46:14,348 INFO L131 PetriNetUnfolder]: For 9919/9919 co-relation queries the response was YES. [2023-09-01 09:46:14,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26959 conditions, 9250 events. 6661/9250 cut-off events. For 9919/9919 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 44017 event pairs, 1727 based on Foata normal form. 96/9346 useless extension candidates. Maximal degree in co-relation 26944. Up to 4171 conditions per place. [2023-09-01 09:46:14,392 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 54 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2023-09-01 09:46:14,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 466 flow [2023-09-01 09:46:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2023-09-01 09:46:14,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5010729613733905 [2023-09-01 09:46:14,396 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 467 transitions. [2023-09-01 09:46:14,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 467 transitions. [2023-09-01 09:46:14,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:14,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 467 transitions. [2023-09-01 09:46:14,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.75) internal successors, (467), 4 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:14,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:14,400 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:14,401 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 198 flow. Second operand 4 states and 467 transitions. [2023-09-01 09:46:14,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 466 flow [2023-09-01 09:46:14,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 466 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:46:14,424 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 346 flow [2023-09-01 09:46:14,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2023-09-01 09:46:14,426 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-09-01 09:46:14,426 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 346 flow [2023-09-01 09:46:14,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:14,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:14,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:14,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:46:14,427 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:14,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:14,428 INFO L85 PathProgramCache]: Analyzing trace with hash 105050101, now seen corresponding path program 1 times [2023-09-01 09:46:14,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:14,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709228694] [2023-09-01 09:46:14,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:14,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:14,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709228694] [2023-09-01 09:46:14,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709228694] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:14,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:14,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:46:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454626039] [2023-09-01 09:46:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:14,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:14,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:14,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:14,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:14,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-09-01 09:46:14,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:14,720 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:14,720 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-09-01 09:46:14,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:15,607 INFO L130 PetriNetUnfolder]: 6533/9074 cut-off events. [2023-09-01 09:46:15,607 INFO L131 PetriNetUnfolder]: For 17326/17326 co-relation queries the response was YES. [2023-09-01 09:46:15,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29914 conditions, 9074 events. 6533/9074 cut-off events. For 17326/17326 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 44617 event pairs, 1101 based on Foata normal form. 24/9098 useless extension candidates. Maximal degree in co-relation 29894. Up to 5097 conditions per place. [2023-09-01 09:46:15,656 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 58 selfloop transitions, 29 changer transitions 0/87 dead transitions. [2023-09-01 09:46:15,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 674 flow [2023-09-01 09:46:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-09-01 09:46:15,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160944206008584 [2023-09-01 09:46:15,659 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-09-01 09:46:15,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-09-01 09:46:15,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:15,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-09-01 09:46:15,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:15,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:15,663 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:15,663 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 346 flow. Second operand 4 states and 481 transitions. [2023-09-01 09:46:15,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 87 transitions, 674 flow [2023-09-01 09:46:15,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 87 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:15,705 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 510 flow [2023-09-01 09:46:15,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=510, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2023-09-01 09:46:15,707 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-09-01 09:46:15,707 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 510 flow [2023-09-01 09:46:15,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:15,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:15,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:15,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:46:15,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:15,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1506474978, now seen corresponding path program 1 times [2023-09-01 09:46:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845404787] [2023-09-01 09:46:15,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:15,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:15,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:15,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845404787] [2023-09-01 09:46:15,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845404787] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:15,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:15,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:15,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13464397] [2023-09-01 09:46:15,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:15,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:15,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:15,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:15,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-09-01 09:46:15,999 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:15,999 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:15,999 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-09-01 09:46:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:16,841 INFO L130 PetriNetUnfolder]: 8087/11372 cut-off events. [2023-09-01 09:46:16,841 INFO L131 PetriNetUnfolder]: For 35446/35446 co-relation queries the response was YES. [2023-09-01 09:46:16,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40249 conditions, 11372 events. 8087/11372 cut-off events. For 35446/35446 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 59489 event pairs, 1479 based on Foata normal form. 128/11500 useless extension candidates. Maximal degree in co-relation 40226. Up to 4903 conditions per place. [2023-09-01 09:46:16,896 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 57 selfloop transitions, 31 changer transitions 4/92 dead transitions. [2023-09-01 09:46:16,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 854 flow [2023-09-01 09:46:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-09-01 09:46:16,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150214592274678 [2023-09-01 09:46:16,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-09-01 09:46:16,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-09-01 09:46:16,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:16,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-09-01 09:46:16,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:16,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:16,903 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:16,903 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 510 flow. Second operand 4 states and 480 transitions. [2023-09-01 09:46:16,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 854 flow [2023-09-01 09:46:16,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 854 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:46:16,975 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 690 flow [2023-09-01 09:46:16,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=690, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2023-09-01 09:46:16,977 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2023-09-01 09:46:16,978 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 690 flow [2023-09-01 09:46:16,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:16,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:16,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:16,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:46:16,979 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:16,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1506413474, now seen corresponding path program 1 times [2023-09-01 09:46:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004371624] [2023-09-01 09:46:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004371624] [2023-09-01 09:46:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004371624] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771619825] [2023-09-01 09:46:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:17,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:17,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:17,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-09-01 09:46:17,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:17,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:17,227 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-09-01 09:46:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:18,241 INFO L130 PetriNetUnfolder]: 5414/8100 cut-off events. [2023-09-01 09:46:18,241 INFO L131 PetriNetUnfolder]: For 37521/38676 co-relation queries the response was YES. [2023-09-01 09:46:18,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29386 conditions, 8100 events. 5414/8100 cut-off events. For 37521/38676 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 49077 event pairs, 984 based on Foata normal form. 1058/8916 useless extension candidates. Maximal degree in co-relation 29358. Up to 5422 conditions per place. [2023-09-01 09:46:18,293 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 108 selfloop transitions, 10 changer transitions 14/151 dead transitions. [2023-09-01 09:46:18,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 151 transitions, 1917 flow [2023-09-01 09:46:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:46:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:46:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-09-01 09:46:18,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055793991416309 [2023-09-01 09:46:18,296 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-09-01 09:46:18,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-09-01 09:46:18,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:18,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-09-01 09:46:18,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:18,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:18,300 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:18,300 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 690 flow. Second operand 5 states and 589 transitions. [2023-09-01 09:46:18,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 151 transitions, 1917 flow [2023-09-01 09:46:18,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 151 transitions, 1909 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-09-01 09:46:18,332 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 763 flow [2023-09-01 09:46:18,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=763, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2023-09-01 09:46:18,333 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-09-01 09:46:18,333 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 763 flow [2023-09-01 09:46:18,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:18,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:18,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:18,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:46:18,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:18,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:18,335 INFO L85 PathProgramCache]: Analyzing trace with hash 887089525, now seen corresponding path program 1 times [2023-09-01 09:46:18,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:18,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83613105] [2023-09-01 09:46:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:18,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:18,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83613105] [2023-09-01 09:46:18,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83613105] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:18,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:18,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:46:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629318988] [2023-09-01 09:46:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:18,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:46:18,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:18,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:46:18,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:46:18,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-09-01 09:46:18,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 763 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:18,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:18,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-09-01 09:46:18,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:19,913 INFO L130 PetriNetUnfolder]: 8791/13068 cut-off events. [2023-09-01 09:46:19,913 INFO L131 PetriNetUnfolder]: For 74538/74538 co-relation queries the response was YES. [2023-09-01 09:46:19,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61777 conditions, 13068 events. 8791/13068 cut-off events. For 74538/74538 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 78169 event pairs, 2367 based on Foata normal form. 78/13146 useless extension candidates. Maximal degree in co-relation 61744. Up to 6229 conditions per place. [2023-09-01 09:46:19,964 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 76 selfloop transitions, 24 changer transitions 26/126 dead transitions. [2023-09-01 09:46:19,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 126 transitions, 1378 flow [2023-09-01 09:46:19,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:46:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:46:19,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-09-01 09:46:19,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160944206008584 [2023-09-01 09:46:19,967 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-09-01 09:46:19,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-09-01 09:46:19,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:19,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-09-01 09:46:19,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,970 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:19,971 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 763 flow. Second operand 4 states and 481 transitions. [2023-09-01 09:46:19,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 126 transitions, 1378 flow [2023-09-01 09:46:20,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 126 transitions, 1365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:20,049 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 824 flow [2023-09-01 09:46:20,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=824, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2023-09-01 09:46:20,050 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2023-09-01 09:46:20,050 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 824 flow [2023-09-01 09:46:20,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:20,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:20,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:20,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:46:20,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:20,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1445622354, now seen corresponding path program 1 times [2023-09-01 09:46:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:20,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451868913] [2023-09-01 09:46:20,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:20,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:20,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:20,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:20,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451868913] [2023-09-01 09:46:20,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451868913] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:20,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:20,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:46:20,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680166665] [2023-09-01 09:46:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:20,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:46:20,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:20,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:46:20,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:46:20,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-09-01 09:46:20,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 824 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:20,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:20,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-09-01 09:46:20,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:20,928 INFO L130 PetriNetUnfolder]: 3529/5666 cut-off events. [2023-09-01 09:46:20,928 INFO L131 PetriNetUnfolder]: For 30697/31340 co-relation queries the response was YES. [2023-09-01 09:46:20,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24819 conditions, 5666 events. 3529/5666 cut-off events. For 30697/31340 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 36246 event pairs, 371 based on Foata normal form. 798/6329 useless extension candidates. Maximal degree in co-relation 24782. Up to 2703 conditions per place. [2023-09-01 09:46:20,960 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 129 selfloop transitions, 14 changer transitions 14/174 dead transitions. [2023-09-01 09:46:20,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 174 transitions, 2482 flow [2023-09-01 09:46:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:46:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:46:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 709 transitions. [2023-09-01 09:46:20,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071530758226037 [2023-09-01 09:46:20,968 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 709 transitions. [2023-09-01 09:46:20,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 709 transitions. [2023-09-01 09:46:20,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:20,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 709 transitions. [2023-09-01 09:46:20,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:20,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:20,978 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:20,978 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 824 flow. Second operand 6 states and 709 transitions. [2023-09-01 09:46:20,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 174 transitions, 2482 flow [2023-09-01 09:46:21,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 174 transitions, 2466 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-09-01 09:46:21,033 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 936 flow [2023-09-01 09:46:21,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2023-09-01 09:46:21,034 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2023-09-01 09:46:21,034 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 936 flow [2023-09-01 09:46:21,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:21,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:21,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:21,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:46:21,035 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:21,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 73498427, now seen corresponding path program 1 times [2023-09-01 09:46:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102081241] [2023-09-01 09:46:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:21,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:21,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:21,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102081241] [2023-09-01 09:46:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102081241] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:21,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:21,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:46:21,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686278268] [2023-09-01 09:46:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:21,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:46:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:46:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:46:21,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-09-01 09:46:21,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 936 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:21,320 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:21,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-09-01 09:46:21,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:22,027 INFO L130 PetriNetUnfolder]: 3046/4963 cut-off events. [2023-09-01 09:46:22,027 INFO L131 PetriNetUnfolder]: For 30614/31768 co-relation queries the response was YES. [2023-09-01 09:46:22,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25913 conditions, 4963 events. 3046/4963 cut-off events. For 30614/31768 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 31806 event pairs, 191 based on Foata normal form. 659/5503 useless extension candidates. Maximal degree in co-relation 25872. Up to 2474 conditions per place. [2023-09-01 09:46:22,049 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 126 selfloop transitions, 22 changer transitions 46/209 dead transitions. [2023-09-01 09:46:22,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 209 transitions, 2988 flow [2023-09-01 09:46:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:46:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:46:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 944 transitions. [2023-09-01 09:46:22,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5064377682403434 [2023-09-01 09:46:22,052 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 944 transitions. [2023-09-01 09:46:22,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 944 transitions. [2023-09-01 09:46:22,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:22,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 944 transitions. [2023-09-01 09:46:22,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.0) internal successors, (944), 8 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:22,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:22,057 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:22,057 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 936 flow. Second operand 8 states and 944 transitions. [2023-09-01 09:46:22,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 209 transitions, 2988 flow [2023-09-01 09:46:22,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 209 transitions, 2942 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-09-01 09:46:22,197 INFO L231 Difference]: Finished difference. Result has 83 places, 77 transitions, 998 flow [2023-09-01 09:46:22,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=998, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2023-09-01 09:46:22,198 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-09-01 09:46:22,198 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 998 flow [2023-09-01 09:46:22,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:22,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:22,199 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] [2023-09-01 09:46:22,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:46:22,199 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:22,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:22,199 INFO L85 PathProgramCache]: Analyzing trace with hash -976470361, now seen corresponding path program 1 times [2023-09-01 09:46:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:22,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139476339] [2023-09-01 09:46:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:22,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:22,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:22,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:22,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139476339] [2023-09-01 09:46:22,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139476339] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:22,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:22,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:46:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032674730] [2023-09-01 09:46:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:22,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:46:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:22,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:46:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:46:22,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-09-01 09:46:22,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 998 flow. Second operand has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:22,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:22,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-09-01 09:46:22,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:23,186 INFO L130 PetriNetUnfolder]: 2793/4620 cut-off events. [2023-09-01 09:46:23,186 INFO L131 PetriNetUnfolder]: For 31088/31614 co-relation queries the response was YES. [2023-09-01 09:46:23,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24367 conditions, 4620 events. 2793/4620 cut-off events. For 31088/31614 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 30079 event pairs, 175 based on Foata normal form. 347/4850 useless extension candidates. Maximal degree in co-relation 24323. Up to 1565 conditions per place. [2023-09-01 09:46:23,215 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 71 selfloop transitions, 21 changer transitions 101/200 dead transitions. [2023-09-01 09:46:23,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 200 transitions, 2854 flow [2023-09-01 09:46:23,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:46:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:46:23,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1154 transitions. [2023-09-01 09:46:23,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49527896995708154 [2023-09-01 09:46:23,219 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1154 transitions. [2023-09-01 09:46:23,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1154 transitions. [2023-09-01 09:46:23,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:23,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1154 transitions. [2023-09-01 09:46:23,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.4) internal successors, (1154), 10 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:23,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:23,227 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 233.0) internal successors, (2563), 11 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:23,227 INFO L175 Difference]: Start difference. First operand has 83 places, 77 transitions, 998 flow. Second operand 10 states and 1154 transitions. [2023-09-01 09:46:23,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 200 transitions, 2854 flow [2023-09-01 09:46:23,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 200 transitions, 2562 flow, removed 42 selfloop flow, removed 8 redundant places. [2023-09-01 09:46:23,489 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 524 flow [2023-09-01 09:46:23,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=524, PETRI_PLACES=87, PETRI_TRANSITIONS=52} [2023-09-01 09:46:23,490 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2023-09-01 09:46:23,490 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 524 flow [2023-09-01 09:46:23,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:23,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:23,491 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] [2023-09-01 09:46:23,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:46:23,491 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:23,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:23,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1847763083, now seen corresponding path program 1 times [2023-09-01 09:46:23,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:23,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229594647] [2023-09-01 09:46:23,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:23,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229594647] [2023-09-01 09:46:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229594647] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:23,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:23,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:46:23,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282758035] [2023-09-01 09:46:23,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:23,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:46:23,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:23,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:46:23,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:46:23,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 233 [2023-09-01 09:46:23,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 524 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:23,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:23,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 233 [2023-09-01 09:46:23,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:24,041 INFO L130 PetriNetUnfolder]: 624/1088 cut-off events. [2023-09-01 09:46:24,042 INFO L131 PetriNetUnfolder]: For 6763/6763 co-relation queries the response was YES. [2023-09-01 09:46:24,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 1088 events. 624/1088 cut-off events. For 6763/6763 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5038 event pairs, 35 based on Foata normal form. 1/1089 useless extension candidates. Maximal degree in co-relation 5665. Up to 511 conditions per place. [2023-09-01 09:46:24,049 INFO L137 encePairwiseOnDemand]: 223/233 looper letters, 69 selfloop transitions, 19 changer transitions 31/119 dead transitions. [2023-09-01 09:46:24,049 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 119 transitions, 1261 flow [2023-09-01 09:46:24,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:46:24,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:46:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 780 transitions. [2023-09-01 09:46:24,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47823421213979156 [2023-09-01 09:46:24,052 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 780 transitions. [2023-09-01 09:46:24,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 780 transitions. [2023-09-01 09:46:24,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:24,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 780 transitions. [2023-09-01 09:46:24,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.42857142857143) internal successors, (780), 7 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,057 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,057 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 524 flow. Second operand 7 states and 780 transitions. [2023-09-01 09:46:24,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 119 transitions, 1261 flow [2023-09-01 09:46:24,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 953 flow, removed 55 selfloop flow, removed 22 redundant places. [2023-09-01 09:46:24,074 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 458 flow [2023-09-01 09:46:24,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=458, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-09-01 09:46:24,075 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-09-01 09:46:24,075 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 458 flow [2023-09-01 09:46:24,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:24,076 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] [2023-09-01 09:46:24,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:46:24,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:24,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1768885079, now seen corresponding path program 2 times [2023-09-01 09:46:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564340589] [2023-09-01 09:46:24,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:24,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:24,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564340589] [2023-09-01 09:46:24,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564340589] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:24,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:24,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:46:24,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304995272] [2023-09-01 09:46:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:24,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:46:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:46:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:46:24,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 233 [2023-09-01 09:46:24,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 458 flow. Second operand has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:24,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 233 [2023-09-01 09:46:24,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:24,625 INFO L130 PetriNetUnfolder]: 410/719 cut-off events. [2023-09-01 09:46:24,626 INFO L131 PetriNetUnfolder]: For 2864/2864 co-relation queries the response was YES. [2023-09-01 09:46:24,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 719 events. 410/719 cut-off events. For 2864/2864 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2828 event pairs, 49 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 3368. Up to 320 conditions per place. [2023-09-01 09:46:24,629 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 42 selfloop transitions, 7 changer transitions 62/111 dead transitions. [2023-09-01 09:46:24,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 111 transitions, 993 flow [2023-09-01 09:46:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:46:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:46:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 879 transitions. [2023-09-01 09:46:24,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715665236051502 [2023-09-01 09:46:24,632 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 879 transitions. [2023-09-01 09:46:24,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 879 transitions. [2023-09-01 09:46:24,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:24,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 879 transitions. [2023-09-01 09:46:24,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.875) internal successors, (879), 8 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,638 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,638 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 458 flow. Second operand 8 states and 879 transitions. [2023-09-01 09:46:24,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 111 transitions, 993 flow [2023-09-01 09:46:24,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 947 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-09-01 09:46:24,646 INFO L231 Difference]: Finished difference. Result has 71 places, 37 transitions, 249 flow [2023-09-01 09:46:24,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=249, PETRI_PLACES=71, PETRI_TRANSITIONS=37} [2023-09-01 09:46:24,647 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-09-01 09:46:24,647 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 37 transitions, 249 flow [2023-09-01 09:46:24,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.57142857142857) internal successors, (732), 7 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:24,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:24,648 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] [2023-09-01 09:46:24,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:46:24,648 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:24,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:24,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2113464933, now seen corresponding path program 3 times [2023-09-01 09:46:24,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:24,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927204248] [2023-09-01 09:46:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:24,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:46:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:46:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:46:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927204248] [2023-09-01 09:46:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927204248] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:46:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:46:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:46:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654326536] [2023-09-01 09:46:26,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:46:26,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:46:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:46:26,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:46:26,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:46:27,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 233 [2023-09-01 09:46:27,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 37 transitions, 249 flow. Second operand has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:46:27,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 233 [2023-09-01 09:46:27,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:46:27,304 INFO L130 PetriNetUnfolder]: 108/218 cut-off events. [2023-09-01 09:46:27,304 INFO L131 PetriNetUnfolder]: For 952/957 co-relation queries the response was YES. [2023-09-01 09:46:27,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 218 events. 108/218 cut-off events. For 952/957 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 760 event pairs, 14 based on Foata normal form. 2/218 useless extension candidates. Maximal degree in co-relation 998. Up to 95 conditions per place. [2023-09-01 09:46:27,305 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 38 selfloop transitions, 5 changer transitions 22/68 dead transitions. [2023-09-01 09:46:27,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 583 flow [2023-09-01 09:46:27,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:46:27,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:46:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 884 transitions. [2023-09-01 09:46:27,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742489270386266 [2023-09-01 09:46:27,309 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 884 transitions. [2023-09-01 09:46:27,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 884 transitions. [2023-09-01 09:46:27,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:46:27,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 884 transitions. [2023-09-01 09:46:27,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,314 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,314 INFO L175 Difference]: Start difference. First operand has 71 places, 37 transitions, 249 flow. Second operand 8 states and 884 transitions. [2023-09-01 09:46:27,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 583 flow [2023-09-01 09:46:27,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 464 flow, removed 8 selfloop flow, removed 21 redundant places. [2023-09-01 09:46:27,317 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 182 flow [2023-09-01 09:46:27,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-09-01 09:46:27,318 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2023-09-01 09:46:27,318 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 182 flow [2023-09-01 09:46:27,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:46:27,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:46:27,319 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] [2023-09-01 09:46:27,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:46:27,319 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:46:27,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:46:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1212908859, now seen corresponding path program 4 times [2023-09-01 09:46:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:46:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203564271] [2023-09-01 09:46:27,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:46:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:46:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:46:27,374 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:46:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:46:27,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:46:27,482 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:46:27,483 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:46:27,484 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:46:27,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:46:27,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:46:27,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:46:27,485 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:46:27,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:46:27,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:46:27,486 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:46:27,492 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:46:27,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:46:27,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:46:27 BasicIcfg [2023-09-01 09:46:27,583 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:46:27,583 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:46:27,583 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:46:27,584 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:46:27,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:46:05" (3/4) ... [2023-09-01 09:46:27,586 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:46:27,673 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:46:27,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:46:27,674 INFO L158 Benchmark]: Toolchain (without parser) took 24020.93ms. Allocated memory was 81.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 58.5MB in the beginning and 960.0MB in the end (delta: -901.5MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-09-01 09:46:27,674 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:46:27,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.91ms. Allocated memory is still 81.8MB. Free memory was 58.3MB in the beginning and 54.0MB in the end (delta: 4.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-09-01 09:46:27,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.84ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 51.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:46:27,677 INFO L158 Benchmark]: Boogie Preprocessor took 29.26ms. Allocated memory is still 81.8MB. Free memory was 51.3MB in the beginning and 49.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:46:27,678 INFO L158 Benchmark]: RCFGBuilder took 693.46ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 36.2MB in the end (delta: 13.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2023-09-01 09:46:27,678 INFO L158 Benchmark]: TraceAbstraction took 22553.84ms. Allocated memory was 81.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 35.7MB in the beginning and 973.7MB in the end (delta: -937.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-09-01 09:46:27,678 INFO L158 Benchmark]: Witness Printer took 90.33ms. Allocated memory is still 2.1GB. Free memory was 973.7MB in the beginning and 960.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-09-01 09:46:27,680 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 41.1MB in the end (delta: 57.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 606.91ms. Allocated memory is still 81.8MB. Free memory was 58.3MB in the beginning and 54.0MB in the end (delta: 4.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.84ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 51.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.26ms. Allocated memory is still 81.8MB. Free memory was 51.3MB in the beginning and 49.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 693.46ms. Allocated memory is still 81.8MB. Free memory was 49.2MB in the beginning and 36.2MB in the end (delta: 13.0MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 22553.84ms. Allocated memory was 81.8MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 35.7MB in the beginning and 973.7MB in the end (delta: -937.9MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 90.33ms. Allocated memory is still 2.1GB. Free memory was 973.7MB in the beginning and 960.0MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 134 PlacesBefore, 40 PlacesAfterwards, 123 TransitionsBefore, 28 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 6374 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2962, independent: 2764, independent conditional: 0, independent unconditional: 2764, dependent: 198, dependent conditional: 0, dependent unconditional: 198, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1470, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2962, independent: 1337, independent conditional: 0, independent unconditional: 1337, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 1470, unknown conditional: 0, unknown unconditional: 1470] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L862] 0 pthread_t t557; [L863] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t557, ((void *)0), P0, ((void *)0))=0, t557={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 0 pthread_t t558; [L865] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t558, ((void *)0), P1, ((void *)0))=1, t557={6:0}, t558={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L866] 0 pthread_t t559; [L867] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t559, ((void *)0), P2, ((void *)0))=2, t557={6:0}, t558={7:0}, t559={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t560; [L869] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t560, ((void *)0), P3, ((void *)0))=3, t557={6:0}, t558={7:0}, t559={8:0}, t560={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 z$flush_delayed = weak$$choice2 [L824] 4 z$mem_tmp = z [L825] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L826] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L827] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L828] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L829] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L831] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = z [L833] 4 z = z$flush_delayed ? z$mem_tmp : z [L834] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L841] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L842] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L844] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L876] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L877] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L878] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L879] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t557={6:0}, t558={7:0}, t559={8:0}, t560={5:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 161 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.4s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 780 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1632 IncrementalHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 84 mSDtfsCounter, 1632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=998occurred in iteration=10, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 2375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:46:27,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE