./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.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/thin002_power.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 e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --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:22:36,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 23:22:36,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 23:22:36,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 23:22:36,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 23:22:36,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 23:22:36,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 23:22:36,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 23:22:36,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 23:22:36,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 23:22:36,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 23:22:36,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 23:22:36,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 23:22:36,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 23:22:36,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 23:22:36,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 23:22:36,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 23:22:36,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 23:22:36,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 23:22:36,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 23:22:36,929 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 23:22:36,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 23:22:36,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 23:22:36,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 23:22:36,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 23:22:36,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 23:22:36,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 23:22:36,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 23:22:36,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 23:22:36,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 23:22:36,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 23:22:36,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 23:22:36,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 23:22:36,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 23:22:36,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 23:22:36,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 23:22:36,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 23:22:36,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 23:22:36,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 23:22:36,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 23:22:36,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 23:22:36,950 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:22:36,976 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 23:22:36,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 23:22:36,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 23:22:36,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 23:22:36,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 23:22:36,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 23:22:36,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 23:22:36,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 23:22:36,979 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 23:22:36,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 23:22:36,980 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 23:22:36,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 23:22:36,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 23:22:36,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 23:22:36,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 23:22:36,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 23:22:36,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 23:22:36,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 23:22:36,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:22:36,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 23:22:36,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 23:22:36,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 23:22:36,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 23:22:36,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 23:22:36,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 23:22:36,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 23:22:36,983 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 23:22:36,984 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 23:22:36,984 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 23:22:36,984 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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 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:22:37,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 23:22:37,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 23:22:37,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 23:22:37,352 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 23:22:37,353 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 23:22:37,354 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-30 23:22:38,581 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 23:22:38,761 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 23:22:38,762 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.opt.i [2023-08-30 23:22:38,770 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099b6ed72/c723acb8dd4a47478202b42472c6ba0c/FLAG89c31a155 [2023-08-30 23:22:38,780 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099b6ed72/c723acb8dd4a47478202b42472c6ba0c [2023-08-30 23:22:38,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 23:22:38,783 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 23:22:38,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 23:22:38,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 23:22:38,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 23:22:38,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:22:38" (1/1) ... [2023-08-30 23:22:38,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5040b524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:38, skipping insertion in model container [2023-08-30 23:22:38,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 11:22:38" (1/1) ... [2023-08-30 23:22:38,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 23:22:38,823 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 23:22:38,921 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/thin002_power.opt.i[951,964] [2023-08-30 23:22:39,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:22:39,026 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 23:22:39,034 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/thin002_power.opt.i[951,964] [2023-08-30 23:22:39,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 23:22:39,088 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:22:39,089 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 23:22:39,093 INFO L208 MainTranslator]: Completed translation [2023-08-30 23:22:39,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39 WrapperNode [2023-08-30 23:22:39,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 23:22:39,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 23:22:39,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 23:22:39,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 23:22:39,099 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:22:39" (1/1) ... [2023-08-30 23:22:39,124 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:22:39" (1/1) ... [2023-08-30 23:22:39,153 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2023-08-30 23:22:39,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 23:22:39,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 23:22:39,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 23:22:39,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 23:22:39,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,193 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 23:22:39,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 23:22:39,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 23:22:39,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 23:22:39,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (1/1) ... [2023-08-30 23:22:39,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 23:22:39,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 23:22:39,232 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:22:39,251 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:22:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 23:22:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 23:22:39,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 23:22:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 23:22:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 23:22:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 23:22:39,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 23:22:39,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 23:22:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 23:22:39,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 23:22:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 23:22:39,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 23:22:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 23:22:39,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 23:22:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 23:22:39,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 23:22:39,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 23:22:39,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 23:22:39,263 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:22:39,378 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 23:22:39,379 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 23:22:39,720 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 23:22:40,026 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 23:22:40,027 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 23:22:40,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:22:40 BoogieIcfgContainer [2023-08-30 23:22:40,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 23:22:40,030 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 23:22:40,030 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 23:22:40,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 23:22:40,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 11:22:38" (1/3) ... [2023-08-30 23:22:40,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329c9e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:22:40, skipping insertion in model container [2023-08-30 23:22:40,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 11:22:39" (2/3) ... [2023-08-30 23:22:40,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329c9e14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 11:22:40, skipping insertion in model container [2023-08-30 23:22:40,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:22:40" (3/3) ... [2023-08-30 23:22:40,035 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2023-08-30 23:22:40,040 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 23:22:40,047 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 23:22:40,048 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 23:22:40,048 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 23:22:40,125 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 23:22:40,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 149 transitions, 318 flow [2023-08-30 23:22:40,205 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2023-08-30 23:22:40,205 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:22:40,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-30 23:22:40,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 149 transitions, 318 flow [2023-08-30 23:22:40,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 145 transitions, 302 flow [2023-08-30 23:22:40,215 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 23:22:40,222 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 145 transitions, 302 flow [2023-08-30 23:22:40,224 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 145 transitions, 302 flow [2023-08-30 23:22:40,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 145 transitions, 302 flow [2023-08-30 23:22:40,249 INFO L130 PetriNetUnfolder]: 2/145 cut-off events. [2023-08-30 23:22:40,249 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:22:40,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 2/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-30 23:22:40,251 INFO L119 LiptonReduction]: Number of co-enabled transitions 2750 [2023-08-30 23:22:46,375 INFO L134 LiptonReduction]: Checked pairs total: 8236 [2023-08-30 23:22:46,375 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-08-30 23:22:46,392 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 23:22:46,397 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;@4dec2d4e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 23:22:46,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 23:22:46,403 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2023-08-30 23:22:46,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 23:22:46,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:46,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:46,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:46,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2036960237, now seen corresponding path program 1 times [2023-08-30 23:22:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070439251] [2023-08-30 23:22:46,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:46,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:46,812 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:22:46,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:46,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070439251] [2023-08-30 23:22:46,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070439251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:46,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:46,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 23:22:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845710729] [2023-08-30 23:22:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:22:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:46,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:22:46,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:22:46,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 274 [2023-08-30 23:22:46,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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:22:46,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:46,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 274 [2023-08-30 23:22:46,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:47,617 INFO L130 PetriNetUnfolder]: 3674/5108 cut-off events. [2023-08-30 23:22:47,618 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2023-08-30 23:22:47,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10279 conditions, 5108 events. 3674/5108 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 26562 event pairs, 1325 based on Foata normal form. 180/4906 useless extension candidates. Maximal degree in co-relation 10267. Up to 3160 conditions per place. [2023-08-30 23:22:47,643 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 34 selfloop transitions, 2 changer transitions 4/43 dead transitions. [2023-08-30 23:22:47,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 181 flow [2023-08-30 23:22:47,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:22:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:22:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-30 23:22:47,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5413625304136253 [2023-08-30 23:22:47,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-30 23:22:47,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-30 23:22:47,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:47,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-30 23:22:47,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 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:22:47,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:47,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:47,674 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 445 transitions. [2023-08-30 23:22:47,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 181 flow [2023-08-30 23:22:47,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 23:22:47,679 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-30 23:22:47,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-30 23:22:47,682 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-08-30 23:22:47,683 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-30 23:22:47,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 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:22:47,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:47,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:47,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 23:22:47,686 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:47,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:47,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1381930948, now seen corresponding path program 1 times [2023-08-30 23:22:47,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159798217] [2023-08-30 23:22:47,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:47,955 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:22:47,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159798217] [2023-08-30 23:22:47,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159798217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:47,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:47,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:47,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969257827] [2023-08-30 23:22:47,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:47,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:47,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:47,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-08-30 23:22:47,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:22:47,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:47,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-08-30 23:22:47,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:48,488 INFO L130 PetriNetUnfolder]: 2649/4021 cut-off events. [2023-08-30 23:22:48,489 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-08-30 23:22:48,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4021 events. 2649/4021 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 23058 event pairs, 508 based on Foata normal form. 180/4185 useless extension candidates. Maximal degree in co-relation 8065. Up to 2539 conditions per place. [2023-08-30 23:22:48,500 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 38 selfloop transitions, 2 changer transitions 21/64 dead transitions. [2023-08-30 23:22:48,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 274 flow [2023-08-30 23:22:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:22:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:22:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-30 23:22:48,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167883211678832 [2023-08-30 23:22:48,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-30 23:22:48,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-30 23:22:48,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:48,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-30 23:22:48,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 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:22:48,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:48,507 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:48,507 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 5 states and 708 transitions. [2023-08-30 23:22:48,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 274 flow [2023-08-30 23:22:48,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:48,509 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 72 flow [2023-08-30 23:22:48,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-30 23:22:48,510 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-30 23:22:48,510 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 72 flow [2023-08-30 23:22:48,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 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:22:48,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:48,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:48,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 23:22:48,511 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:48,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:48,511 INFO L85 PathProgramCache]: Analyzing trace with hash 109773549, now seen corresponding path program 1 times [2023-08-30 23:22:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535292340] [2023-08-30 23:22:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:48,684 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:22:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535292340] [2023-08-30 23:22:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535292340] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295677199] [2023-08-30 23:22:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:48,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:48,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:48,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-08-30 23:22:48,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:22:48,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:48,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-08-30 23:22:48,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:49,282 INFO L130 PetriNetUnfolder]: 3486/5016 cut-off events. [2023-08-30 23:22:49,282 INFO L131 PetriNetUnfolder]: For 649/649 co-relation queries the response was YES. [2023-08-30 23:22:49,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10961 conditions, 5016 events. 3486/5016 cut-off events. For 649/649 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 26230 event pairs, 932 based on Foata normal form. 150/5162 useless extension candidates. Maximal degree in co-relation 10948. Up to 1681 conditions per place. [2023-08-30 23:22:49,294 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 39 selfloop transitions, 3 changer transitions 23/67 dead transitions. [2023-08-30 23:22:49,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 291 flow [2023-08-30 23:22:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-08-30 23:22:49,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504257907542579 [2023-08-30 23:22:49,296 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-08-30 23:22:49,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-08-30 23:22:49,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:49,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-08-30 23:22:49,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 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:22:49,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:49,301 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:49,301 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 72 flow. Second operand 6 states and 829 transitions. [2023-08-30 23:22:49,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 291 flow [2023-08-30 23:22:49,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 281 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:22:49,316 INFO L231 Difference]: Finished difference. Result has 45 places, 26 transitions, 82 flow [2023-08-30 23:22:49,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2023-08-30 23:22:49,316 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-30 23:22:49,316 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 82 flow [2023-08-30 23:22:49,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 23:22:49,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:49,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:49,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 23:22:49,317 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:49,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash -108819960, now seen corresponding path program 1 times [2023-08-30 23:22:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:49,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728182994] [2023-08-30 23:22:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:49,512 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:22:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728182994] [2023-08-30 23:22:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728182994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453368723] [2023-08-30 23:22:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:49,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:49,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:49,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-08-30 23:22:49,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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:22:49,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:49,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-08-30 23:22:49,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:49,854 INFO L130 PetriNetUnfolder]: 1617/2475 cut-off events. [2023-08-30 23:22:49,855 INFO L131 PetriNetUnfolder]: For 802/802 co-relation queries the response was YES. [2023-08-30 23:22:49,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5647 conditions, 2475 events. 1617/2475 cut-off events. For 802/802 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12467 event pairs, 714 based on Foata normal form. 90/2535 useless extension candidates. Maximal degree in co-relation 5632. Up to 1611 conditions per place. [2023-08-30 23:22:49,866 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 36 selfloop transitions, 2 changer transitions 17/58 dead transitions. [2023-08-30 23:22:49,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 270 flow [2023-08-30 23:22:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:22:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:22:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-08-30 23:22:49,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124087591240876 [2023-08-30 23:22:49,871 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-08-30 23:22:49,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-08-30 23:22:49,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:49,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-08-30 23:22:49,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 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:22:49,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:49,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:49,875 INFO L175 Difference]: Start difference. First operand has 45 places, 26 transitions, 82 flow. Second operand 5 states and 702 transitions. [2023-08-30 23:22:49,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 270 flow [2023-08-30 23:22:49,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 245 flow, removed 6 selfloop flow, removed 7 redundant places. [2023-08-30 23:22:49,879 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 76 flow [2023-08-30 23:22:49,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-30 23:22:49,880 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-30 23:22:49,880 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 76 flow [2023-08-30 23:22:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 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:22:49,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:49,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:49,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 23:22:49,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:49,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 920614783, now seen corresponding path program 1 times [2023-08-30 23:22:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638017626] [2023-08-30 23:22:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:50,073 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:22:50,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638017626] [2023-08-30 23:22:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638017626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581394612] [2023-08-30 23:22:50,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:50,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-08-30 23:22:50,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 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:22:50,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:50,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-08-30 23:22:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:50,447 INFO L130 PetriNetUnfolder]: 2439/3563 cut-off events. [2023-08-30 23:22:50,447 INFO L131 PetriNetUnfolder]: For 710/710 co-relation queries the response was YES. [2023-08-30 23:22:50,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 3563 events. 2439/3563 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17159 event pairs, 826 based on Foata normal form. 90/3622 useless extension candidates. Maximal degree in co-relation 8037. Up to 1120 conditions per place. [2023-08-30 23:22:50,458 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 38 selfloop transitions, 3 changer transitions 21/64 dead transitions. [2023-08-30 23:22:50,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 287 flow [2023-08-30 23:22:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:50,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:50,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 826 transitions. [2023-08-30 23:22:50,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024330900243309 [2023-08-30 23:22:50,461 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 826 transitions. [2023-08-30 23:22:50,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 826 transitions. [2023-08-30 23:22:50,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:50,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 826 transitions. [2023-08-30 23:22:50,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.66666666666666) internal successors, (826), 6 states have internal predecessors, (826), 0 states have call successors, (0), 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:22:50,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:50,465 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:50,465 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 76 flow. Second operand 6 states and 826 transitions. [2023-08-30 23:22:50,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 287 flow [2023-08-30 23:22:50,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 64 transitions, 277 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:22:50,470 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 86 flow [2023-08-30 23:22:50,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-08-30 23:22:50,470 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-30 23:22:50,471 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 86 flow [2023-08-30 23:22:50,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 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:22:50,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:50,471 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:22:50,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 23:22:50,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:50,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1903289830, now seen corresponding path program 1 times [2023-08-30 23:22:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497955690] [2023-08-30 23:22:50,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:50,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:50,701 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:22:50,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497955690] [2023-08-30 23:22:50,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497955690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:50,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:50,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:50,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695084702] [2023-08-30 23:22:50,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:50,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:50,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:50,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 274 [2023-08-30 23:22:50,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 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:22:50,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:50,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 274 [2023-08-30 23:22:50,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:50,956 INFO L130 PetriNetUnfolder]: 1080/1602 cut-off events. [2023-08-30 23:22:50,956 INFO L131 PetriNetUnfolder]: For 863/863 co-relation queries the response was YES. [2023-08-30 23:22:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3871 conditions, 1602 events. 1080/1602 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7585 event pairs, 168 based on Foata normal form. 60/1648 useless extension candidates. Maximal degree in co-relation 3856. Up to 1253 conditions per place. [2023-08-30 23:22:50,964 INFO L137 encePairwiseOnDemand]: 270/274 looper letters, 32 selfloop transitions, 2 changer transitions 13/50 dead transitions. [2023-08-30 23:22:50,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 243 flow [2023-08-30 23:22:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:22:50,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:22:50,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-08-30 23:22:50,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065693430656935 [2023-08-30 23:22:50,966 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-08-30 23:22:50,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-08-30 23:22:50,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:50,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-08-30 23:22:50,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 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:22:50,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:50,970 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:50,970 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 86 flow. Second operand 5 states and 694 transitions. [2023-08-30 23:22:50,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 243 flow [2023-08-30 23:22:50,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 211 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-30 23:22:50,973 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 76 flow [2023-08-30 23:22:50,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-30 23:22:50,973 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-30 23:22:50,974 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 76 flow [2023-08-30 23:22:50,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 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:22:50,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:50,974 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:22:50,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 23:22:50,975 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:50,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:50,975 INFO L85 PathProgramCache]: Analyzing trace with hash -628893214, now seen corresponding path program 1 times [2023-08-30 23:22:50,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:50,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836383122] [2023-08-30 23:22:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:50,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:51,172 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:22:51,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836383122] [2023-08-30 23:22:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836383122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:51,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190661139] [2023-08-30 23:22:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:51,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 274 [2023-08-30 23:22:51,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 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:22:51,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:51,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 274 [2023-08-30 23:22:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:51,464 INFO L130 PetriNetUnfolder]: 1703/2481 cut-off events. [2023-08-30 23:22:51,465 INFO L131 PetriNetUnfolder]: For 525/525 co-relation queries the response was YES. [2023-08-30 23:22:51,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 2481 events. 1703/2481 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10353 event pairs, 583 based on Foata normal form. 72/2499 useless extension candidates. Maximal degree in co-relation 5569. Up to 809 conditions per place. [2023-08-30 23:22:51,469 INFO L137 encePairwiseOnDemand]: 269/274 looper letters, 32 selfloop transitions, 3 changer transitions 23/60 dead transitions. [2023-08-30 23:22:51,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 271 flow [2023-08-30 23:22:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:51,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions. [2023-08-30 23:22:51,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-30 23:22:51,472 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 822 transitions. [2023-08-30 23:22:51,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions. [2023-08-30 23:22:51,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:51,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions. [2023-08-30 23:22:51,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 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:22:51,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:51,475 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:51,475 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 76 flow. Second operand 6 states and 822 transitions. [2023-08-30 23:22:51,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 271 flow [2023-08-30 23:22:51,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 261 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-30 23:22:51,478 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 86 flow [2023-08-30 23:22:51,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-08-30 23:22:51,478 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-30 23:22:51,479 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 86 flow [2023-08-30 23:22:51,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 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:22:51,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:51,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:51,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 23:22:51,479 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:51,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1976934963, now seen corresponding path program 1 times [2023-08-30 23:22:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672080738] [2023-08-30 23:22:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:52,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:22:52,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:52,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672080738] [2023-08-30 23:22:52,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672080738] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:52,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:52,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:22:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329817797] [2023-08-30 23:22:52,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:52,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 23:22:52,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:52,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 23:22:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 23:22:52,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-30 23:22:52,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 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:22:52,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:52,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-30 23:22:52,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:52,686 INFO L130 PetriNetUnfolder]: 692/1049 cut-off events. [2023-08-30 23:22:52,687 INFO L131 PetriNetUnfolder]: For 662/662 co-relation queries the response was YES. [2023-08-30 23:22:52,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2518 conditions, 1049 events. 692/1049 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3996 event pairs, 150 based on Foata normal form. 48/1097 useless extension candidates. Maximal degree in co-relation 2503. Up to 799 conditions per place. [2023-08-30 23:22:52,689 INFO L137 encePairwiseOnDemand]: 267/274 looper letters, 34 selfloop transitions, 6 changer transitions 17/60 dead transitions. [2023-08-30 23:22:52,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 289 flow [2023-08-30 23:22:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:22:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:22:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1004 transitions. [2023-08-30 23:22:52,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458029197080292 [2023-08-30 23:22:52,692 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1004 transitions. [2023-08-30 23:22:52,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1004 transitions. [2023-08-30 23:22:52,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:52,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1004 transitions. [2023-08-30 23:22:52,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.5) internal successors, (1004), 8 states have internal predecessors, (1004), 0 states have call successors, (0), 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:22:52,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:52,696 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:52,696 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 86 flow. Second operand 8 states and 1004 transitions. [2023-08-30 23:22:52,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 289 flow [2023-08-30 23:22:52,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 251 flow, removed 11 selfloop flow, removed 8 redundant places. [2023-08-30 23:22:52,699 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 110 flow [2023-08-30 23:22:52,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2023-08-30 23:22:52,701 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-30 23:22:52,702 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 30 transitions, 110 flow [2023-08-30 23:22:52,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 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:22:52,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:52,702 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:22:52,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 23:22:52,702 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:52,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:52,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1936490929, now seen corresponding path program 1 times [2023-08-30 23:22:52,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:52,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056809120] [2023-08-30 23:22:52,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:52,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:53,833 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:22:53,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:53,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056809120] [2023-08-30 23:22:53,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056809120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 23:22:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613626214] [2023-08-30 23:22:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:53,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 23:22:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 23:22:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-30 23:22:53,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 274 [2023-08-30 23:22:53,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 30 transitions, 110 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 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:22:53,944 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:53,944 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 274 [2023-08-30 23:22:53,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:54,268 INFO L130 PetriNetUnfolder]: 692/1051 cut-off events. [2023-08-30 23:22:54,269 INFO L131 PetriNetUnfolder]: For 633/633 co-relation queries the response was YES. [2023-08-30 23:22:54,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 1051 events. 692/1051 cut-off events. For 633/633 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3867 event pairs, 146 based on Foata normal form. 32/1071 useless extension candidates. Maximal degree in co-relation 2783. Up to 561 conditions per place. [2023-08-30 23:22:54,273 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 34 selfloop transitions, 8 changer transitions 14/59 dead transitions. [2023-08-30 23:22:54,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 310 flow [2023-08-30 23:22:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 23:22:54,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 23:22:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1015 transitions. [2023-08-30 23:22:54,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4630474452554745 [2023-08-30 23:22:54,276 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1015 transitions. [2023-08-30 23:22:54,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1015 transitions. [2023-08-30 23:22:54,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:54,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1015 transitions. [2023-08-30 23:22:54,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.875) internal successors, (1015), 8 states have internal predecessors, (1015), 0 states have call successors, (0), 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:22:54,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:54,281 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 274.0) internal successors, (2466), 9 states have internal predecessors, (2466), 0 states have call successors, (0), 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:22:54,281 INFO L175 Difference]: Start difference. First operand has 48 places, 30 transitions, 110 flow. Second operand 8 states and 1015 transitions. [2023-08-30 23:22:54,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 310 flow [2023-08-30 23:22:54,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 302 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:54,284 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 167 flow [2023-08-30 23:22:54,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=55, PETRI_TRANSITIONS=34} [2023-08-30 23:22:54,284 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-30 23:22:54,285 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 167 flow [2023-08-30 23:22:54,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 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:22:54,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:54,285 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] [2023-08-30 23:22:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 23:22:54,286 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:54,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -98661278, now seen corresponding path program 1 times [2023-08-30 23:22:54,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:54,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062229442] [2023-08-30 23:22:54,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:54,558 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:22:54,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062229442] [2023-08-30 23:22:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062229442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 23:22:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356312413] [2023-08-30 23:22:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:54,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 23:22:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:54,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 23:22:54,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 23:22:54,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 274 [2023-08-30 23:22:54,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 34 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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:22:54,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:54,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 274 [2023-08-30 23:22:54,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:54,667 INFO L130 PetriNetUnfolder]: 515/792 cut-off events. [2023-08-30 23:22:54,667 INFO L131 PetriNetUnfolder]: For 976/976 co-relation queries the response was YES. [2023-08-30 23:22:54,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2524 conditions, 792 events. 515/792 cut-off events. For 976/976 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2814 event pairs, 230 based on Foata normal form. 14/802 useless extension candidates. Maximal degree in co-relation 2504. Up to 764 conditions per place. [2023-08-30 23:22:54,670 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 41 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2023-08-30 23:22:54,671 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 336 flow [2023-08-30 23:22:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 23:22:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 23:22:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-30 23:22:54,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158150851581509 [2023-08-30 23:22:54,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-30 23:22:54,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-30 23:22:54,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:54,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-30 23:22:54,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 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:22:54,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:54,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 274.0) internal successors, (1096), 4 states have internal predecessors, (1096), 0 states have call successors, (0), 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:22:54,675 INFO L175 Difference]: Start difference. First operand has 55 places, 34 transitions, 167 flow. Second operand 3 states and 424 transitions. [2023-08-30 23:22:54,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 336 flow [2023-08-30 23:22:54,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 303 flow, removed 9 selfloop flow, removed 7 redundant places. [2023-08-30 23:22:54,678 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 176 flow [2023-08-30 23:22:54,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-30 23:22:54,679 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-30 23:22:54,679 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 176 flow [2023-08-30 23:22:54,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 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:22:54,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:54,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:54,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 23:22:54,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:54,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash -568712109, now seen corresponding path program 1 times [2023-08-30 23:22:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093544082] [2023-08-30 23:22:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:55,949 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:22:55,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:55,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093544082] [2023-08-30 23:22:55,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093544082] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:55,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:55,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 23:22:55,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441944291] [2023-08-30 23:22:55,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:55,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 23:22:55,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:55,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 23:22:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-30 23:22:56,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 274 [2023-08-30 23:22:56,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 176 flow. Second operand has 9 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 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:22:56,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:56,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 274 [2023-08-30 23:22:56,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:56,317 INFO L130 PetriNetUnfolder]: 551/856 cut-off events. [2023-08-30 23:22:56,317 INFO L131 PetriNetUnfolder]: For 794/797 co-relation queries the response was YES. [2023-08-30 23:22:56,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2965 conditions, 856 events. 551/856 cut-off events. For 794/797 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3230 event pairs, 88 based on Foata normal form. 21/872 useless extension candidates. Maximal degree in co-relation 2948. Up to 576 conditions per place. [2023-08-30 23:22:56,319 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 49 selfloop transitions, 11 changer transitions 9/72 dead transitions. [2023-08-30 23:22:56,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 482 flow [2023-08-30 23:22:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:22:56,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:22:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-30 23:22:56,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572471324296142 [2023-08-30 23:22:56,322 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-30 23:22:56,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-30 23:22:56,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:56,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-30 23:22:56,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 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:22:56,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:56,326 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:56,326 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 176 flow. Second operand 7 states and 877 transitions. [2023-08-30 23:22:56,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 482 flow [2023-08-30 23:22:56,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 23:22:56,328 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 275 flow [2023-08-30 23:22:56,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-30 23:22:56,328 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-08-30 23:22:56,328 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 275 flow [2023-08-30 23:22:56,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 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:22:56,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:56,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:56,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 23:22:56,329 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:56,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1055818134, now seen corresponding path program 1 times [2023-08-30 23:22:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893111739] [2023-08-30 23:22:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:56,517 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:22:56,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893111739] [2023-08-30 23:22:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893111739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 23:22:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208519746] [2023-08-30 23:22:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:56,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 23:22:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:56,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 23:22:56,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 23:22:56,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 274 [2023-08-30 23:22:56,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 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:22:56,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:56,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 274 [2023-08-30 23:22:56,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:56,607 INFO L130 PetriNetUnfolder]: 290/491 cut-off events. [2023-08-30 23:22:56,608 INFO L131 PetriNetUnfolder]: For 968/971 co-relation queries the response was YES. [2023-08-30 23:22:56,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 491 events. 290/491 cut-off events. For 968/971 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1800 event pairs, 39 based on Foata normal form. 31/518 useless extension candidates. Maximal degree in co-relation 1921. Up to 402 conditions per place. [2023-08-30 23:22:56,609 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 58 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-30 23:22:56,610 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 70 transitions, 585 flow [2023-08-30 23:22:56,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 23:22:56,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 23:22:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-08-30 23:22:56,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136861313868614 [2023-08-30 23:22:56,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-08-30 23:22:56,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-08-30 23:22:56,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:56,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-08-30 23:22:56,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 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:22:56,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 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:22:56,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 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:22:56,614 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 275 flow. Second operand 4 states and 563 transitions. [2023-08-30 23:22:56,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 70 transitions, 585 flow [2023-08-30 23:22:56,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 555 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-30 23:22:56,616 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 307 flow [2023-08-30 23:22:56,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2023-08-30 23:22:56,616 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2023-08-30 23:22:56,617 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 307 flow [2023-08-30 23:22:56,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 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:22:56,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:56,617 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:22:56,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 23:22:56,617 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:56,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1071585237, now seen corresponding path program 1 times [2023-08-30 23:22:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334216352] [2023-08-30 23:22:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:57,666 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:22:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:57,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334216352] [2023-08-30 23:22:57,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334216352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:57,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:57,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 23:22:57,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282064303] [2023-08-30 23:22:57,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:57,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 23:22:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 23:22:57,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-30 23:22:57,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 274 [2023-08-30 23:22:57,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 307 flow. Second operand has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 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:22:57,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:57,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 274 [2023-08-30 23:22:57,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:58,001 INFO L130 PetriNetUnfolder]: 292/507 cut-off events. [2023-08-30 23:22:58,002 INFO L131 PetriNetUnfolder]: For 1128/1132 co-relation queries the response was YES. [2023-08-30 23:22:58,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 507 events. 292/507 cut-off events. For 1128/1132 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1833 event pairs, 82 based on Foata normal form. 12/518 useless extension candidates. Maximal degree in co-relation 2177. Up to 409 conditions per place. [2023-08-30 23:22:58,006 INFO L137 encePairwiseOnDemand]: 266/274 looper letters, 61 selfloop transitions, 8 changer transitions 9/81 dead transitions. [2023-08-30 23:22:58,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 663 flow [2023-08-30 23:22:58,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 23:22:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 23:22:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2023-08-30 23:22:58,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4494264859228363 [2023-08-30 23:22:58,008 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2023-08-30 23:22:58,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2023-08-30 23:22:58,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:58,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2023-08-30 23:22:58,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 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:22:58,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:58,012 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 274.0) internal successors, (2192), 8 states have internal predecessors, (2192), 0 states have call successors, (0), 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:22:58,012 INFO L175 Difference]: Start difference. First operand has 55 places, 49 transitions, 307 flow. Second operand 7 states and 862 transitions. [2023-08-30 23:22:58,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 663 flow [2023-08-30 23:22:58,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 625 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-30 23:22:58,015 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 346 flow [2023-08-30 23:22:58,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-08-30 23:22:58,016 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2023-08-30 23:22:58,016 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 346 flow [2023-08-30 23:22:58,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 118.0) internal successors, (1180), 10 states have internal predecessors, (1180), 0 states have call successors, (0), 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:22:58,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:58,017 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:22:58,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 23:22:58,017 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:58,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2104669253, now seen corresponding path program 1 times [2023-08-30 23:22:58,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:58,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980151619] [2023-08-30 23:22:58,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:58,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:58,205 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:22:58,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980151619] [2023-08-30 23:22:58,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980151619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:58,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:58,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 23:22:58,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552240756] [2023-08-30 23:22:58,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:58,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 23:22:58,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:58,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 23:22:58,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 23:22:58,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 274 [2023-08-30 23:22:58,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 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:22:58,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:58,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 274 [2023-08-30 23:22:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:58,292 INFO L130 PetriNetUnfolder]: 138/261 cut-off events. [2023-08-30 23:22:58,292 INFO L131 PetriNetUnfolder]: For 668/686 co-relation queries the response was YES. [2023-08-30 23:22:58,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 261 events. 138/261 cut-off events. For 668/686 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 795 event pairs, 7 based on Foata normal form. 37/296 useless extension candidates. Maximal degree in co-relation 1104. Up to 108 conditions per place. [2023-08-30 23:22:58,293 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 58 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2023-08-30 23:22:58,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 74 transitions, 649 flow [2023-08-30 23:22:58,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 23:22:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 23:22:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-08-30 23:22:58,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116788321167883 [2023-08-30 23:22:58,295 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-08-30 23:22:58,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-08-30 23:22:58,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:58,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-08-30 23:22:58,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 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:22:58,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:58,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 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:22:58,298 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 346 flow. Second operand 5 states and 701 transitions. [2023-08-30 23:22:58,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 74 transitions, 649 flow [2023-08-30 23:22:58,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 569 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-08-30 23:22:58,305 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 296 flow [2023-08-30 23:22:58,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-30 23:22:58,305 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-30 23:22:58,305 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 296 flow [2023-08-30 23:22:58,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 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:22:58,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:58,306 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] [2023-08-30 23:22:58,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 23:22:58,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:58,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash -117733095, now seen corresponding path program 1 times [2023-08-30 23:22:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:58,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113663471] [2023-08-30 23:22:58,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:58,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 23:22:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 23:22:58,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 23:22:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113663471] [2023-08-30 23:22:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113663471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 23:22:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 23:22:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 23:22:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492011290] [2023-08-30 23:22:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 23:22:58,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 23:22:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 23:22:58,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 23:22:58,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 23:22:58,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 274 [2023-08-30 23:22:58,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 296 flow. Second operand has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 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:22:58,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 23:22:58,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 274 [2023-08-30 23:22:58,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 23:22:58,610 INFO L130 PetriNetUnfolder]: 110/202 cut-off events. [2023-08-30 23:22:58,611 INFO L131 PetriNetUnfolder]: For 580/586 co-relation queries the response was YES. [2023-08-30 23:22:58,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 202 events. 110/202 cut-off events. For 580/586 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 583 event pairs, 3 based on Foata normal form. 13/211 useless extension candidates. Maximal degree in co-relation 905. Up to 83 conditions per place. [2023-08-30 23:22:58,612 INFO L137 encePairwiseOnDemand]: 268/274 looper letters, 49 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2023-08-30 23:22:58,612 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 579 flow [2023-08-30 23:22:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 23:22:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 23:22:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 831 transitions. [2023-08-30 23:22:58,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054744525547445 [2023-08-30 23:22:58,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 831 transitions. [2023-08-30 23:22:58,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 831 transitions. [2023-08-30 23:22:58,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 23:22:58,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 831 transitions. [2023-08-30 23:22:58,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 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:22:58,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:58,628 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 274.0) internal successors, (1918), 7 states have internal predecessors, (1918), 0 states have call successors, (0), 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:22:58,629 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 296 flow. Second operand 6 states and 831 transitions. [2023-08-30 23:22:58,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 579 flow [2023-08-30 23:22:58,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 450 flow, removed 19 selfloop flow, removed 10 redundant places. [2023-08-30 23:22:58,631 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 242 flow [2023-08-30 23:22:58,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=274, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-30 23:22:58,632 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-30 23:22:58,632 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 242 flow [2023-08-30 23:22:58,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 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:22:58,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 23:22:58,632 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:22:58,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 23:22:58,633 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 23:22:58,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 23:22:58,633 INFO L85 PathProgramCache]: Analyzing trace with hash -549095343, now seen corresponding path program 1 times [2023-08-30 23:22:58,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 23:22:58,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033784087] [2023-08-30 23:22:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 23:22:58,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 23:22:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:22:58,702 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 23:22:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 23:22:58,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 23:22:58,780 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 23:22:58,781 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 23:22:58,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 23:22:58,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 23:22:58,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 23:22:58,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 23:22:58,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 23:22:58,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 23:22:58,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 23:22:58,784 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 23:22:58,787 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 23:22:58,787 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 23:22:58,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 11:22:58 BasicIcfg [2023-08-30 23:22:58,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 23:22:58,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 23:22:58,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 23:22:58,882 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 23:22:58,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 11:22:40" (3/4) ... [2023-08-30 23:22:58,884 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 23:22:58,965 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 23:22:58,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 23:22:58,966 INFO L158 Benchmark]: Toolchain (without parser) took 20183.17ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.1MB in the beginning and 911.2MB in the end (delta: -868.1MB). Peak memory consumption was 235.9MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,966 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 58.7MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 23:22:58,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.35ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 33.9MB in the end (delta: 9.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.00ms. Allocated memory is still 71.3MB. Free memory was 33.9MB in the beginning and 31.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,967 INFO L158 Benchmark]: Boogie Preprocessor took 51.82ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 50.0MB in the end (delta: -18.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,967 INFO L158 Benchmark]: RCFGBuilder took 819.15ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 50.0MB in the beginning and 45.1MB in the end (delta: 4.9MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,967 INFO L158 Benchmark]: TraceAbstraction took 18851.85ms. Allocated memory was 86.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 44.6MB in the beginning and 933.2MB in the end (delta: -888.6MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,967 INFO L158 Benchmark]: Witness Printer took 83.16ms. Allocated memory is still 1.2GB. Free memory was 933.2MB in the beginning and 911.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-08-30 23:22:58,969 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.56ms. Allocated memory is still 58.7MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.35ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 33.9MB in the end (delta: 9.0MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.00ms. Allocated memory is still 71.3MB. Free memory was 33.9MB in the beginning and 31.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.82ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 50.0MB in the end (delta: -18.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 819.15ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 50.0MB in the beginning and 45.1MB in the end (delta: 4.9MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18851.85ms. Allocated memory was 86.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 44.6MB in the beginning and 933.2MB in the end (delta: -888.6MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. * Witness Printer took 83.16ms. Allocated memory is still 1.2GB. Free memory was 933.2MB in the beginning and 911.2MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 156 PlacesBefore, 42 PlacesAfterwards, 145 TransitionsBefore, 30 TransitionsAfterwards, 2750 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 8236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3765, independent: 3506, independent conditional: 0, independent unconditional: 3506, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1471, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3765, independent: 2071, independent conditional: 0, independent unconditional: 2071, dependent: 223, dependent conditional: 0, dependent unconditional: 223, unknown: 1471, unknown conditional: 0, unknown unconditional: 1471] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-3, t2709={7:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=-2, t2709={7:0}, t2710={5:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=-1, t2709={7:0}, t2710={5:0}, t2711={6:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=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={3:0}] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=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$$choice1=1, 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=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={3:0}] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L786] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 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) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 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 [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L789] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=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={3:0}] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 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) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 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 [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=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, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] 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=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, __unbuffered_p3_EAX=1, 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$$choice0=0, weak$$choice1=1, 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=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - 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: 880]: 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: 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: 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: 882]: 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, 183 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: 18.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1162 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 933 mSDsluCounter, 1016 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 969 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2306 IncrementalHoareTripleChecker+Invalid, 2502 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 47 mSDtfsCounter, 2306 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=13, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 299 NumberOfCodeBlocks, 299 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 2679 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:22:58,994 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