./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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/mix013.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 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 23:08:37,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:08:37,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:08:37,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:08:37,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:08:37,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:08:37,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:08:37,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:08:37,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:08:37,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:08:37,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:08:37,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:08:37,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:08:37,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:08:37,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:08:37,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:08:37,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:08:37,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:08:37,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:08:37,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:08:37,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:08:37,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:08:37,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:08:37,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:08:37,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:08:37,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:08:37,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:08:37,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:08:37,694 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:08:37,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:08:37,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:08:37,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:08:37,697 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:08:37,698 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:08:37,699 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:08:37,699 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:08:37,699 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:08:37,699 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:08:37,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:08:37,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:08:37,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:08:37,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 23:08:37,729 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:08:37,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:08:37,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:08:37,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:08:37,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:08:37,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:08:37,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:08:37,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:08:37,732 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:08:37,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:08:37,733 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:08:37,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:08:37,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:08:37,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:08:37,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:08:37,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:08:37,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:08:37,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:08:37,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:08:37,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:08:37,735 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:08:37,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:08:37,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:08:37,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:08:37,736 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:08:37,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:08:37,736 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:08:37,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:08:37,737 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:08:37,737 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 -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 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 -> TOGETHER [2023-08-30 23:08:37,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:08:37,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:08:37,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:08:37,987 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:08:37,987 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:08:37,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-30 23:08:39,071 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:08:39,293 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:08:39,294 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-30 23:08:39,303 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18846f281/b54b4eb155af466ab651d3e365addd20/FLAG1dbea03cf [2023-08-30 23:08:39,312 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18846f281/b54b4eb155af466ab651d3e365addd20 [2023-08-30 23:08:39,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:08:39,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:08:39,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:08:39,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:08:39,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:08:39,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca5cfe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39, skipping insertion in model container [2023-08-30 23:08:39,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:08:39,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:08:39,457 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/mix013.opt.i[944,957] [2023-08-30 23:08:39,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:08:39,593 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:08:39,602 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/mix013.opt.i[944,957] [2023-08-30 23:08:39,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:08:39,726 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:08:39,726 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:08:39,730 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:08:39,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39 WrapperNode [2023-08-30 23:08:39,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:08:39,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:08:39,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:08:39,731 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:08:39,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,790 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 167 [2023-08-30 23:08:39,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:08:39,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:08:39,792 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:08:39,792 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:08:39,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,807 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,827 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:08:39,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:08:39,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:08:39,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:08:39,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (1/1) ... [2023-08-30 23:08:39,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:08:39,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:08:39,855 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-08-30 23:08:39,901 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-08-30 23:08:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:08:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:08:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:08:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:08:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:08:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:08:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:08:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:08:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:08:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:08:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:08:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:08:39,903 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:08:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:08:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:08:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:08:39,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:08:39,904 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 23:08:40,051 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:08:40,052 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:08:40,343 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:08:40,455 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:08:40,455 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:08:40,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:40 BoogieIcfgContainer [2023-08-30 23:08:40,457 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:08:40,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:08:40,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:08:40,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:08:40,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:08:39" (1/3) ... [2023-08-30 23:08:40,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7906e67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:08:40, skipping insertion in model container [2023-08-30 23:08:40,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:08:39" (2/3) ... [2023-08-30 23:08:40,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7906e67d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:08:40, skipping insertion in model container [2023-08-30 23:08:40,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:40" (3/3) ... [2023-08-30 23:08:40,462 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2023-08-30 23:08:40,468 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:08:40,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:08:40,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:08:40,474 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:08:40,517 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:08:40,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 23:08:40,615 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 23:08:40,615 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:40,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 23:08:40,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-30 23:08:40,627 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-30 23:08:40,630 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:08:40,642 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 23:08:40,646 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-30 23:08:40,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-30 23:08:40,672 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2023-08-30 23:08:40,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:40,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-08-30 23:08:40,678 INFO L119 LiptonReduction]: Number of co-enabled transitions 2850 [2023-08-30 23:08:43,825 INFO L134 LiptonReduction]: Checked pairs total: 7092 [2023-08-30 23:08:43,826 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-30 23:08:43,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:08:43,839 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;@7e1f7d15, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:08:43,839 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:08:43,844 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2023-08-30 23:08:43,844 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:08:43,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:43,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:43,845 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-08-30 23:08:43,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:43,848 INFO L85 PathProgramCache]: Analyzing trace with hash 209759451, now seen corresponding path program 1 times [2023-08-30 23:08:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420674687] [2023-08-30 23:08:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:44,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:44,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420674687] [2023-08-30 23:08:44,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420674687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:44,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:44,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:08:44,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253881032] [2023-08-30 23:08:44,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:44,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:44,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:44,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:44,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:44,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 241 [2023-08-30 23:08:44,271 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-08-30 23:08:44,271 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:44,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 241 [2023-08-30 23:08:44,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:44,729 INFO L130 PetriNetUnfolder]: 2594/3785 cut-off events. [2023-08-30 23:08:44,729 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-08-30 23:08:44,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7480 conditions, 3785 events. 2594/3785 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20519 event pairs, 518 based on Foata normal form. 0/3595 useless extension candidates. Maximal degree in co-relation 7468. Up to 2797 conditions per place. [2023-08-30 23:08:44,746 INFO L137 encePairwiseOnDemand]: 237/241 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-30 23:08:44,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2023-08-30 23:08:44,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:44,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 23:08:44,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366528354080221 [2023-08-30 23:08:44,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 23:08:44,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 23:08:44,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:44,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 23:08:44,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 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-08-30 23:08:44,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:44,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:44,768 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 388 transitions. [2023-08-30 23:08:44,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2023-08-30 23:08:44,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:44,784 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-08-30 23:08:44,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-30 23:08:44,788 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 23:08:44,788 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-08-30 23:08:44,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-08-30 23:08:44,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:44,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:44,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:08:44,790 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-08-30 23:08:44,790 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:44,790 INFO L85 PathProgramCache]: Analyzing trace with hash -284572345, now seen corresponding path program 1 times [2023-08-30 23:08:44,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:44,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095204160] [2023-08-30 23:08:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:44,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:45,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:45,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095204160] [2023-08-30 23:08:45,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095204160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:45,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:45,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:08:45,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849535575] [2023-08-30 23:08:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:45,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:08:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:45,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:08:45,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:08:45,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-30 23:08:45,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-08-30 23:08:45,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:45,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-30 23:08:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:45,675 INFO L130 PetriNetUnfolder]: 5909/8022 cut-off events. [2023-08-30 23:08:45,675 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2023-08-30 23:08:45,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16570 conditions, 8022 events. 5909/8022 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 35185 event pairs, 2449 based on Foata normal form. 16/8038 useless extension candidates. Maximal degree in co-relation 16560. Up to 7831 conditions per place. [2023-08-30 23:08:45,710 INFO L137 encePairwiseOnDemand]: 235/241 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-08-30 23:08:45,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2023-08-30 23:08:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:45,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:45,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-30 23:08:45,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5076071922544951 [2023-08-30 23:08:45,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-30 23:08:45,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-30 23:08:45,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:45,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-30 23:08:45,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-08-30 23:08:45,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:45,717 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:45,717 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 367 transitions. [2023-08-30 23:08:45,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2023-08-30 23:08:45,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:45,719 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2023-08-30 23:08:45,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-08-30 23:08:45,720 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-30 23:08:45,720 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2023-08-30 23:08:45,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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-08-30 23:08:45,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:45,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:45,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:08:45,721 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-08-30 23:08:45,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 403181, now seen corresponding path program 1 times [2023-08-30 23:08:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690226102] [2023-08-30 23:08:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:45,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690226102] [2023-08-30 23:08:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690226102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:45,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:45,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:45,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988828418] [2023-08-30 23:08:45,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:45,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:45,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:45,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-30 23:08:45,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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-08-30 23:08:45,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:45,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-30 23:08:45,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:46,505 INFO L130 PetriNetUnfolder]: 5333/7270 cut-off events. [2023-08-30 23:08:46,505 INFO L131 PetriNetUnfolder]: For 1342/1342 co-relation queries the response was YES. [2023-08-30 23:08:46,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16745 conditions, 7270 events. 5333/7270 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 32167 event pairs, 2179 based on Foata normal form. 176/7446 useless extension candidates. Maximal degree in co-relation 16734. Up to 5011 conditions per place. [2023-08-30 23:08:46,534 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-08-30 23:08:46,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 231 flow [2023-08-30 23:08:46,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:46,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-30 23:08:46,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089903181189488 [2023-08-30 23:08:46,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-30 23:08:46,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-30 23:08:46,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:46,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-30 23:08:46,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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-08-30 23:08:46,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:46,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:46,542 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 368 transitions. [2023-08-30 23:08:46,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 231 flow [2023-08-30 23:08:46,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:08:46,544 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2023-08-30 23:08:46,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-30 23:08:46,545 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-30 23:08:46,548 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2023-08-30 23:08:46,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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-08-30 23:08:46,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:46,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:46,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:08:46,549 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-08-30 23:08:46,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:46,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1768441453, now seen corresponding path program 1 times [2023-08-30 23:08:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211219806] [2023-08-30 23:08:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:46,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:46,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:46,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211219806] [2023-08-30 23:08:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211219806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:46,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:08:46,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396980399] [2023-08-30 23:08:46,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:46,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:46,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:46,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-30 23:08:46,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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-08-30 23:08:46,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:46,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-30 23:08:46,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:47,153 INFO L130 PetriNetUnfolder]: 5029/6870 cut-off events. [2023-08-30 23:08:47,153 INFO L131 PetriNetUnfolder]: For 2219/2219 co-relation queries the response was YES. [2023-08-30 23:08:47,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16473 conditions, 6870 events. 5029/6870 cut-off events. For 2219/2219 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 29084 event pairs, 1599 based on Foata normal form. 96/6966 useless extension candidates. Maximal degree in co-relation 16460. Up to 4561 conditions per place. [2023-08-30 23:08:47,170 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-30 23:08:47,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 216 flow [2023-08-30 23:08:47,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:08:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:08:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-30 23:08:47,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020746887966805 [2023-08-30 23:08:47,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-30 23:08:47,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-30 23:08:47,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:47,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-30 23:08:47,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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-08-30 23:08:47,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:47,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-30 23:08:47,178 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 3 states and 363 transitions. [2023-08-30 23:08:47,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 216 flow [2023-08-30 23:08:47,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:47,180 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 104 flow [2023-08-30 23:08:47,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-30 23:08:47,182 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-30 23:08:47,182 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 104 flow [2023-08-30 23:08:47,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 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-08-30 23:08:47,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:47,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:47,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:08:47,183 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-08-30 23:08:47,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:47,183 INFO L85 PathProgramCache]: Analyzing trace with hash 162994496, now seen corresponding path program 1 times [2023-08-30 23:08:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:47,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110995635] [2023-08-30 23:08:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110995635] [2023-08-30 23:08:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110995635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:47,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:47,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358246668] [2023-08-30 23:08:47,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:47,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:47,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:47,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:47,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 23:08:47,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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-08-30 23:08:47,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:47,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 23:08:47,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:47,810 INFO L130 PetriNetUnfolder]: 2515/3796 cut-off events. [2023-08-30 23:08:47,811 INFO L131 PetriNetUnfolder]: For 1130/1148 co-relation queries the response was YES. [2023-08-30 23:08:47,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 3796 events. 2515/3796 cut-off events. For 1130/1148 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20805 event pairs, 441 based on Foata normal form. 289/3979 useless extension candidates. Maximal degree in co-relation 8914. Up to 1619 conditions per place. [2023-08-30 23:08:47,824 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 47 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2023-08-30 23:08:47,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 288 flow [2023-08-30 23:08:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:08:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:08:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 497 transitions. [2023-08-30 23:08:47,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155601659751037 [2023-08-30 23:08:47,826 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 497 transitions. [2023-08-30 23:08:47,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 497 transitions. [2023-08-30 23:08:47,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:47,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 497 transitions. [2023-08-30 23:08:47,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 0 states have call successors, (0), 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-08-30 23:08:47,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-30 23:08:47,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-30 23:08:47,829 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 104 flow. Second operand 4 states and 497 transitions. [2023-08-30 23:08:47,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 288 flow [2023-08-30 23:08:47,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:47,834 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 144 flow [2023-08-30 23:08:47,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-08-30 23:08:47,836 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-30 23:08:47,836 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 144 flow [2023-08-30 23:08:47,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 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-08-30 23:08:47,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:47,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:08:47,837 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-08-30 23:08:47,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash 875471547, now seen corresponding path program 1 times [2023-08-30 23:08:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989972107] [2023-08-30 23:08:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:48,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:48,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989972107] [2023-08-30 23:08:48,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989972107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:48,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:48,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:08:48,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261035789] [2023-08-30 23:08:48,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:48,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:08:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:48,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:08:48,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:08:48,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 23:08:48,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 144 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 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-08-30 23:08:48,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:48,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 23:08:48,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:48,860 INFO L130 PetriNetUnfolder]: 4246/6674 cut-off events. [2023-08-30 23:08:48,860 INFO L131 PetriNetUnfolder]: For 4346/4369 co-relation queries the response was YES. [2023-08-30 23:08:48,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19668 conditions, 6674 events. 4246/6674 cut-off events. For 4346/4369 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 41832 event pairs, 229 based on Foata normal form. 42/6655 useless extension candidates. Maximal degree in co-relation 19652. Up to 3183 conditions per place. [2023-08-30 23:08:48,878 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 69 selfloop transitions, 9 changer transitions 59/141 dead transitions. [2023-08-30 23:08:48,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 141 transitions, 874 flow [2023-08-30 23:08:48,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 23:08:48,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 23:08:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1094 transitions. [2023-08-30 23:08:48,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5043798985707699 [2023-08-30 23:08:48,881 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1094 transitions. [2023-08-30 23:08:48,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1094 transitions. [2023-08-30 23:08:48,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:48,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1094 transitions. [2023-08-30 23:08:48,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.55555555555556) internal successors, (1094), 9 states have internal predecessors, (1094), 0 states have call successors, (0), 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-08-30 23:08:48,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 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-08-30 23:08:48,886 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 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-08-30 23:08:48,886 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 144 flow. Second operand 9 states and 1094 transitions. [2023-08-30 23:08:48,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 141 transitions, 874 flow [2023-08-30 23:08:48,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 141 transitions, 865 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:08:48,889 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 233 flow [2023-08-30 23:08:48,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=233, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-30 23:08:48,889 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-30 23:08:48,890 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 233 flow [2023-08-30 23:08:48,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 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-08-30 23:08:48,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:48,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:48,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:08:48,890 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-08-30 23:08:48,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2131701394, now seen corresponding path program 1 times [2023-08-30 23:08:48,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:48,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334381541] [2023-08-30 23:08:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:48,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:49,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334381541] [2023-08-30 23:08:49,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334381541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:49,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:49,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:49,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058261577] [2023-08-30 23:08:49,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:49,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:49,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:49,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:49,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:49,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 23:08:49,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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-08-30 23:08:49,102 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:49,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 23:08:49,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:49,460 INFO L130 PetriNetUnfolder]: 2378/3721 cut-off events. [2023-08-30 23:08:49,461 INFO L131 PetriNetUnfolder]: For 8744/8977 co-relation queries the response was YES. [2023-08-30 23:08:49,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13431 conditions, 3721 events. 2378/3721 cut-off events. For 8744/8977 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 21179 event pairs, 377 based on Foata normal form. 270/3889 useless extension candidates. Maximal degree in co-relation 13408. Up to 1333 conditions per place. [2023-08-30 23:08:49,472 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 78 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-30 23:08:49,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 664 flow [2023-08-30 23:08:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-08-30 23:08:49,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5178423236514523 [2023-08-30 23:08:49,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-08-30 23:08:49,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-08-30 23:08:49,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:49,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-08-30 23:08:49,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 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-08-30 23:08:49,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-08-30 23:08:49,477 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-08-30 23:08:49,477 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 233 flow. Second operand 5 states and 624 transitions. [2023-08-30 23:08:49,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 664 flow [2023-08-30 23:08:49,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 610 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:49,491 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 283 flow [2023-08-30 23:08:49,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-30 23:08:49,492 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-30 23:08:49,492 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 283 flow [2023-08-30 23:08:49,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 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-08-30 23:08:49,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:49,492 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] [2023-08-30 23:08:49,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:08:49,493 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-08-30 23:08:49,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:49,493 INFO L85 PathProgramCache]: Analyzing trace with hash -109948537, now seen corresponding path program 1 times [2023-08-30 23:08:49,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:49,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461256487] [2023-08-30 23:08:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:49,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:49,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461256487] [2023-08-30 23:08:49,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461256487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:49,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:49,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:08:49,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829821170] [2023-08-30 23:08:49,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:49,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:08:49,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:49,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:08:49,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:08:49,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 23:08:49,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 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-08-30 23:08:49,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:49,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 23:08:49,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:49,989 INFO L130 PetriNetUnfolder]: 2171/3429 cut-off events. [2023-08-30 23:08:49,989 INFO L131 PetriNetUnfolder]: For 7362/7773 co-relation queries the response was YES. [2023-08-30 23:08:49,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12939 conditions, 3429 events. 2171/3429 cut-off events. For 7362/7773 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19551 event pairs, 370 based on Foata normal form. 164/3494 useless extension candidates. Maximal degree in co-relation 12916. Up to 1333 conditions per place. [2023-08-30 23:08:50,002 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 86 selfloop transitions, 14 changer transitions 0/106 dead transitions. [2023-08-30 23:08:50,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 106 transitions, 750 flow [2023-08-30 23:08:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions. [2023-08-30 23:08:50,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5179806362378977 [2023-08-30 23:08:50,004 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 749 transitions. [2023-08-30 23:08:50,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions. [2023-08-30 23:08:50,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:50,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions. [2023-08-30 23:08:50,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 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-08-30 23:08:50,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-30 23:08:50,008 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-30 23:08:50,008 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 283 flow. Second operand 6 states and 749 transitions. [2023-08-30 23:08:50,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 106 transitions, 750 flow [2023-08-30 23:08:50,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 106 transitions, 734 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-30 23:08:50,014 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 357 flow [2023-08-30 23:08:50,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-08-30 23:08:50,014 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-30 23:08:50,015 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 357 flow [2023-08-30 23:08:50,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 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-08-30 23:08:50,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:50,015 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] [2023-08-30 23:08:50,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:08:50,015 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-08-30 23:08:50,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1083920802, now seen corresponding path program 1 times [2023-08-30 23:08:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:50,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098358013] [2023-08-30 23:08:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:50,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098358013] [2023-08-30 23:08:50,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098358013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604603275] [2023-08-30 23:08:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:50,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:50,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:50,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:08:50,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 357 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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-08-30 23:08:50,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:50,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:08:50,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:50,716 INFO L130 PetriNetUnfolder]: 4917/7310 cut-off events. [2023-08-30 23:08:50,716 INFO L131 PetriNetUnfolder]: For 21078/21078 co-relation queries the response was YES. [2023-08-30 23:08:50,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29113 conditions, 7310 events. 4917/7310 cut-off events. For 21078/21078 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 39804 event pairs, 372 based on Foata normal form. 10/7320 useless extension candidates. Maximal degree in co-relation 29088. Up to 4703 conditions per place. [2023-08-30 23:08:50,741 INFO L137 encePairwiseOnDemand]: 232/241 looper letters, 101 selfloop transitions, 20 changer transitions 13/134 dead transitions. [2023-08-30 23:08:50,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 134 transitions, 1170 flow [2023-08-30 23:08:50,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:08:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:08:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2023-08-30 23:08:50,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020746887966805 [2023-08-30 23:08:50,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 605 transitions. [2023-08-30 23:08:50,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 605 transitions. [2023-08-30 23:08:50,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:50,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 605 transitions. [2023-08-30 23:08:50,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 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-08-30 23:08:50,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-08-30 23:08:50,746 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-08-30 23:08:50,746 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 357 flow. Second operand 5 states and 605 transitions. [2023-08-30 23:08:50,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 134 transitions, 1170 flow [2023-08-30 23:08:50,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 134 transitions, 1088 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-30 23:08:50,803 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 459 flow [2023-08-30 23:08:50,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-08-30 23:08:50,803 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-30 23:08:50,804 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 459 flow [2023-08-30 23:08:50,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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-08-30 23:08:50,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:50,804 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] [2023-08-30 23:08:50,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:08:50,804 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-08-30 23:08:50,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 992040898, now seen corresponding path program 2 times [2023-08-30 23:08:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:50,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713230443] [2023-08-30 23:08:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:51,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:51,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713230443] [2023-08-30 23:08:51,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713230443] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:51,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:08:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002673554] [2023-08-30 23:08:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:51,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:08:51,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:51,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:08:51,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:08:51,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-30 23:08:51,081 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 459 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 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-08-30 23:08:51,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:51,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-30 23:08:51,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:51,403 INFO L130 PetriNetUnfolder]: 1381/2212 cut-off events. [2023-08-30 23:08:51,404 INFO L131 PetriNetUnfolder]: For 6960/7303 co-relation queries the response was YES. [2023-08-30 23:08:51,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9237 conditions, 2212 events. 1381/2212 cut-off events. For 6960/7303 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11690 event pairs, 210 based on Foata normal form. 172/2285 useless extension candidates. Maximal degree in co-relation 9210. Up to 832 conditions per place. [2023-08-30 23:08:51,415 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 84 selfloop transitions, 18 changer transitions 1/114 dead transitions. [2023-08-30 23:08:51,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 114 transitions, 980 flow [2023-08-30 23:08:51,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:08:51,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:08:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-08-30 23:08:51,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020746887966805 [2023-08-30 23:08:51,418 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-08-30 23:08:51,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-08-30 23:08:51,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:51,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-08-30 23:08:51,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 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-08-30 23:08:51,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-30 23:08:51,422 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-30 23:08:51,422 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 459 flow. Second operand 7 states and 847 transitions. [2023-08-30 23:08:51,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 114 transitions, 980 flow [2023-08-30 23:08:51,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 114 transitions, 913 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-30 23:08:51,454 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 451 flow [2023-08-30 23:08:51,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=451, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2023-08-30 23:08:51,455 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-30 23:08:51,455 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 451 flow [2023-08-30 23:08:51,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 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-08-30 23:08:51,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:51,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:51,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:08:51,456 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-08-30 23:08:51,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1952395421, now seen corresponding path program 1 times [2023-08-30 23:08:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:51,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937163682] [2023-08-30 23:08:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:51,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937163682] [2023-08-30 23:08:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937163682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:08:51,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891490496] [2023-08-30 23:08:51,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:51,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:08:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:08:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:08:51,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 241 [2023-08-30 23:08:51,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 451 flow. Second operand has 7 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 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-08-30 23:08:51,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:51,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 241 [2023-08-30 23:08:51,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:52,290 INFO L130 PetriNetUnfolder]: 2378/3622 cut-off events. [2023-08-30 23:08:52,291 INFO L131 PetriNetUnfolder]: For 10388/10388 co-relation queries the response was YES. [2023-08-30 23:08:52,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15077 conditions, 3622 events. 2378/3622 cut-off events. For 10388/10388 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17482 event pairs, 202 based on Foata normal form. 1/3623 useless extension candidates. Maximal degree in co-relation 15051. Up to 2009 conditions per place. [2023-08-30 23:08:52,306 INFO L137 encePairwiseOnDemand]: 231/241 looper letters, 142 selfloop transitions, 67 changer transitions 9/218 dead transitions. [2023-08-30 23:08:52,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 218 transitions, 1958 flow [2023-08-30 23:08:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 23:08:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 23:08:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1139 transitions. [2023-08-30 23:08:52,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726141078838174 [2023-08-30 23:08:52,309 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1139 transitions. [2023-08-30 23:08:52,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1139 transitions. [2023-08-30 23:08:52,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:52,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1139 transitions. [2023-08-30 23:08:52,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.9) internal successors, (1139), 10 states have internal predecessors, (1139), 0 states have call successors, (0), 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-08-30 23:08:52,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 241.0) internal successors, (2651), 11 states have internal predecessors, (2651), 0 states have call successors, (0), 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-08-30 23:08:52,315 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 241.0) internal successors, (2651), 11 states have internal predecessors, (2651), 0 states have call successors, (0), 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-08-30 23:08:52,315 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 451 flow. Second operand 10 states and 1139 transitions. [2023-08-30 23:08:52,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 218 transitions, 1958 flow [2023-08-30 23:08:52,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 218 transitions, 1833 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-30 23:08:52,341 INFO L231 Difference]: Finished difference. Result has 73 places, 119 transitions, 1130 flow [2023-08-30 23:08:52,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1130, PETRI_PLACES=73, PETRI_TRANSITIONS=119} [2023-08-30 23:08:52,342 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 32 predicate places. [2023-08-30 23:08:52,342 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 119 transitions, 1130 flow [2023-08-30 23:08:52,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 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-08-30 23:08:52,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:52,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:52,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:08:52,343 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-08-30 23:08:52,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:52,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1385303629, now seen corresponding path program 2 times [2023-08-30 23:08:52,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:52,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297751573] [2023-08-30 23:08:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:52,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297751573] [2023-08-30 23:08:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297751573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:52,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:52,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732988493] [2023-08-30 23:08:52,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:52,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:52,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:52,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:08:52,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 119 transitions, 1130 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-08-30 23:08:52,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:52,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:08:52,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:52,925 INFO L130 PetriNetUnfolder]: 2730/4158 cut-off events. [2023-08-30 23:08:52,926 INFO L131 PetriNetUnfolder]: For 15375/15375 co-relation queries the response was YES. [2023-08-30 23:08:52,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18559 conditions, 4158 events. 2730/4158 cut-off events. For 15375/15375 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20797 event pairs, 573 based on Foata normal form. 1/4159 useless extension candidates. Maximal degree in co-relation 18529. Up to 2318 conditions per place. [2023-08-30 23:08:52,936 INFO L137 encePairwiseOnDemand]: 233/241 looper letters, 79 selfloop transitions, 10 changer transitions 99/188 dead transitions. [2023-08-30 23:08:52,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 188 transitions, 1905 flow [2023-08-30 23:08:52,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:52,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 718 transitions. [2023-08-30 23:08:52,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49654218533886585 [2023-08-30 23:08:52,939 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 718 transitions. [2023-08-30 23:08:52,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 718 transitions. [2023-08-30 23:08:52,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:52,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 718 transitions. [2023-08-30 23:08:52,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 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-08-30 23:08:52,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-30 23:08:52,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-30 23:08:52,942 INFO L175 Difference]: Start difference. First operand has 73 places, 119 transitions, 1130 flow. Second operand 6 states and 718 transitions. [2023-08-30 23:08:52,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 188 transitions, 1905 flow [2023-08-30 23:08:52,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 188 transitions, 1716 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-08-30 23:08:52,974 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 468 flow [2023-08-30 23:08:52,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-08-30 23:08:52,975 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-30 23:08:52,975 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 468 flow [2023-08-30 23:08:52,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-08-30 23:08:52,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:52,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:52,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:08:52,976 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-08-30 23:08:52,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -706454837, now seen corresponding path program 3 times [2023-08-30 23:08:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:52,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386311030] [2023-08-30 23:08:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:53,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:53,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:53,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386311030] [2023-08-30 23:08:53,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386311030] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:53,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:53,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:08:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906033497] [2023-08-30 23:08:53,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:53,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:08:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:53,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:08:53,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:08:53,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-08-30 23:08:53,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 468 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 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-08-30 23:08:53,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:53,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-08-30 23:08:53,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:53,307 INFO L130 PetriNetUnfolder]: 1115/1972 cut-off events. [2023-08-30 23:08:53,308 INFO L131 PetriNetUnfolder]: For 5808/5822 co-relation queries the response was YES. [2023-08-30 23:08:53,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7442 conditions, 1972 events. 1115/1972 cut-off events. For 5808/5822 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11212 event pairs, 245 based on Foata normal form. 1/1952 useless extension candidates. Maximal degree in co-relation 7421. Up to 1105 conditions per place. [2023-08-30 23:08:53,313 INFO L137 encePairwiseOnDemand]: 238/241 looper letters, 43 selfloop transitions, 1 changer transitions 64/112 dead transitions. [2023-08-30 23:08:53,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 920 flow [2023-08-30 23:08:53,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:08:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:08:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2023-08-30 23:08:53,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217842323651453 [2023-08-30 23:08:53,314 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 503 transitions. [2023-08-30 23:08:53,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 503 transitions. [2023-08-30 23:08:53,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:53,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 503 transitions. [2023-08-30 23:08:53,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.75) internal successors, (503), 4 states have internal predecessors, (503), 0 states have call successors, (0), 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-08-30 23:08:53,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-30 23:08:53,318 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-30 23:08:53,318 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 468 flow. Second operand 4 states and 503 transitions. [2023-08-30 23:08:53,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 920 flow [2023-08-30 23:08:53,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 882 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-30 23:08:53,322 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 216 flow [2023-08-30 23:08:53,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2023-08-30 23:08:53,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-30 23:08:53,323 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 216 flow [2023-08-30 23:08:53,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 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-08-30 23:08:53,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:53,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:53,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:08:53,324 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-08-30 23:08:53,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash 754130023, now seen corresponding path program 4 times [2023-08-30 23:08:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:53,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236505241] [2023-08-30 23:08:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:53,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236505241] [2023-08-30 23:08:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236505241] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:08:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139463649] [2023-08-30 23:08:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:53,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:08:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:53,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:08:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:08:54,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-08-30 23:08:54,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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-08-30 23:08:54,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:54,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-08-30 23:08:54,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:54,168 INFO L130 PetriNetUnfolder]: 420/792 cut-off events. [2023-08-30 23:08:54,168 INFO L131 PetriNetUnfolder]: For 1831/1880 co-relation queries the response was YES. [2023-08-30 23:08:54,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 792 events. 420/792 cut-off events. For 1831/1880 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4160 event pairs, 59 based on Foata normal form. 3/755 useless extension candidates. Maximal degree in co-relation 2742. Up to 307 conditions per place. [2023-08-30 23:08:54,170 INFO L137 encePairwiseOnDemand]: 234/241 looper letters, 36 selfloop transitions, 6 changer transitions 36/83 dead transitions. [2023-08-30 23:08:54,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 560 flow [2023-08-30 23:08:54,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:08:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:08:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 940 transitions. [2023-08-30 23:08:54,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487551867219917 [2023-08-30 23:08:54,173 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 940 transitions. [2023-08-30 23:08:54,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 940 transitions. [2023-08-30 23:08:54,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:54,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 940 transitions. [2023-08-30 23:08:54,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 117.5) internal successors, (940), 8 states have internal predecessors, (940), 0 states have call successors, (0), 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-08-30 23:08:54,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 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-08-30 23:08:54,177 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 241.0) internal successors, (2169), 9 states have internal predecessors, (2169), 0 states have call successors, (0), 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-08-30 23:08:54,178 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 216 flow. Second operand 8 states and 940 transitions. [2023-08-30 23:08:54,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 560 flow [2023-08-30 23:08:54,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 524 flow, removed 13 selfloop flow, removed 7 redundant places. [2023-08-30 23:08:54,180 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 210 flow [2023-08-30 23:08:54,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2023-08-30 23:08:54,181 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-30 23:08:54,181 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 210 flow [2023-08-30 23:08:54,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 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-08-30 23:08:54,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:54,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:54,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:08:54,182 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-08-30 23:08:54,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:54,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1960006061, now seen corresponding path program 5 times [2023-08-30 23:08:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311115474] [2023-08-30 23:08:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:08:54,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:08:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:08:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311115474] [2023-08-30 23:08:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311115474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:08:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:08:54,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:08:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243912096] [2023-08-30 23:08:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:08:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:08:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:08:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:08:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:08:54,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-30 23:08:54,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-08-30 23:08:54,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:08:54,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-30 23:08:54,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:08:54,473 INFO L130 PetriNetUnfolder]: 352/686 cut-off events. [2023-08-30 23:08:54,473 INFO L131 PetriNetUnfolder]: For 979/979 co-relation queries the response was YES. [2023-08-30 23:08:54,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2399 conditions, 686 events. 352/686 cut-off events. For 979/979 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3233 event pairs, 109 based on Foata normal form. 1/687 useless extension candidates. Maximal degree in co-relation 2381. Up to 366 conditions per place. [2023-08-30 23:08:54,475 INFO L137 encePairwiseOnDemand]: 236/241 looper letters, 39 selfloop transitions, 3 changer transitions 34/76 dead transitions. [2023-08-30 23:08:54,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 510 flow [2023-08-30 23:08:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:08:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:08:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-30 23:08:54,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475103734439834 [2023-08-30 23:08:54,477 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-30 23:08:54,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-30 23:08:54,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:08:54,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-30 23:08:54,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 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-08-30 23:08:54,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-30 23:08:54,480 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-30 23:08:54,481 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 210 flow. Second operand 6 states and 687 transitions. [2023-08-30 23:08:54,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 510 flow [2023-08-30 23:08:54,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 76 transitions, 494 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-30 23:08:54,482 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 173 flow [2023-08-30 23:08:54,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-08-30 23:08:54,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-30 23:08:54,483 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 173 flow [2023-08-30 23:08:54,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 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-08-30 23:08:54,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:08:54,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:54,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:08:54,484 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:08:54,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:08:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2086519517, now seen corresponding path program 6 times [2023-08-30 23:08:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:08:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845361721] [2023-08-30 23:08:54,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:08:54,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:08:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:08:54,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:08:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:08:54,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:08:54,558 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:08:54,558 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:08:54,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:08:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:08:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:08:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:08:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:08:54,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:08:54,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 23:08:54,561 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:08:54,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:08:54,564 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:08:54,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:08:54 BasicIcfg [2023-08-30 23:08:54,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:08:54,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:08:54,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:08:54,624 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:08:54,624 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:08:40" (3/4) ... [2023-08-30 23:08:54,626 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:08:54,686 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:08:54,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:08:54,687 INFO L158 Benchmark]: Toolchain (without parser) took 15372.64ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 68.8MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 23:08:54,687 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:08:54,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.63ms. Allocated memory is still 92.3MB. Free memory was 68.8MB in the beginning and 66.0MB in the end (delta: 2.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2023-08-30 23:08:54,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.36ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 63.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:54,688 INFO L158 Benchmark]: Boogie Preprocessor took 43.27ms. Allocated memory is still 92.3MB. Free memory was 63.4MB in the beginning and 61.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:08:54,688 INFO L158 Benchmark]: RCFGBuilder took 622.19ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 54.3MB in the end (delta: 7.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2023-08-30 23:08:54,688 INFO L158 Benchmark]: TraceAbstraction took 14165.22ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.8MB in the beginning and 596.0MB in the end (delta: -542.3MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2023-08-30 23:08:54,688 INFO L158 Benchmark]: Witness Printer took 62.42ms. Allocated memory is still 1.6GB. Free memory was 595.0MB in the beginning and 1.6GB in the end (delta: -964.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-08-30 23:08:54,689 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.15ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.63ms. Allocated memory is still 92.3MB. Free memory was 68.8MB in the beginning and 66.0MB in the end (delta: 2.8MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.36ms. Allocated memory is still 92.3MB. Free memory was 66.0MB in the beginning and 63.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.27ms. Allocated memory is still 92.3MB. Free memory was 63.4MB in the beginning and 61.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 622.19ms. Allocated memory is still 92.3MB. Free memory was 61.4MB in the beginning and 54.3MB in the end (delta: 7.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14165.22ms. Allocated memory was 92.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 53.8MB in the beginning and 596.0MB in the end (delta: -542.3MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 62.42ms. Allocated memory is still 1.6GB. Free memory was 595.0MB in the beginning and 1.6GB in the end (delta: -964.4MB). 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.2s, 138 PlacesBefore, 41 PlacesAfterwards, 127 TransitionsBefore, 29 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 7092 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3541, independent: 3336, independent conditional: 0, independent unconditional: 3336, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1540, independent: 1501, independent conditional: 0, independent unconditional: 1501, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3541, independent: 1835, independent conditional: 0, independent unconditional: 1835, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1540, unknown conditional: 0, unknown unconditional: 1540] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t325, ((void *)0), P0, ((void *)0))=-3, t325={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] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t326, ((void *)0), P1, ((void *)0))=-2, t325={5:0}, t326={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] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t327, ((void *)0), P2, ((void *)0))=-1, t325={5:0}, t326={6:0}, t327={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] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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(&t328, ((void *)0), P3, ((void *)0))=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3: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] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 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) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 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)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=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] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=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] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L789] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 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) [L797] 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)) [L798] 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)) [L799] 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)) [L800] 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)) [L801] 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)) [L802] 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)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, 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] [L849] 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) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 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 [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 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}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 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 [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=1, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=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: 878]: 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: 874]: 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: 876]: 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: 872]: 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, 166 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: 14.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 922 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 788 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1766 IncrementalHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 65 mSDtfsCounter, 1766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1130occurred in iteration=11, InterpolantAutomatonStates: 82, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 2272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-08-30 23:08:54,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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