./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_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 de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:53:34,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:53:34,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:53:34,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:53:34,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:53:34,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:53:34,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:53:34,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:53:34,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:53:34,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:53:34,914 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:53:34,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:53:34,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:53:34,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:53:34,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:53:34,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:53:34,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:53:34,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:53:34,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:53:34,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:53:34,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:53:34,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:53:34,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:53:34,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:53:34,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:53:34,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:53:34,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:53:34,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:53:34,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:53:34,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:53:34,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:53:34,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:53:34,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:53:34,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:53:34,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:53:34,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:53:34,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:53:34,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:53:34,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:53:34,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:53:34,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:53:34,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:53:34,974 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:53:34,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:53:34,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:53:34,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:53:34,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:53:34,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:53:34,977 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:53:34,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:53:34,977 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:53:34,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:53:34,978 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:53:34,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:53:34,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:53:34,979 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:53:34,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:53:34,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:53:34,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:53:34,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:53:34,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:53:34,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:53:34,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:53:34,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:53:34,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:53:34,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:53:34,981 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:53:34,981 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:53:34,982 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:53:34,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:53:34,982 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:53:34,982 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 -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:53:35,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:53:35,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:53:35,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:53:35,202 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:53:35,202 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:53:35,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i [2023-09-01 09:53:36,068 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:53:36,268 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:53:36,269 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_power.opt.i [2023-09-01 09:53:36,285 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb38e6658/b6d32c2fff1447da918ed0d2f8f23f31/FLAGc719a34f1 [2023-09-01 09:53:36,294 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb38e6658/b6d32c2fff1447da918ed0d2f8f23f31 [2023-09-01 09:53:36,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:53:36,297 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:53:36,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:53:36,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:53:36,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:53:36,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@313ef63a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36, skipping insertion in model container [2023-09-01 09:53:36,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,308 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:53:36,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:53:36,488 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/rfi006_power.opt.i[993,1006] [2023-09-01 09:53:36,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:53:36,673 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:53:36,682 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/rfi006_power.opt.i[993,1006] [2023-09-01 09:53:36,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:53:36,742 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:53:36,742 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:53:36,747 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:53:36,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36 WrapperNode [2023-09-01 09:53:36,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:53:36,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:53:36,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:53:36,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:53:36,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,781 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,809 INFO L138 Inliner]: procedures = 176, calls = 75, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2023-09-01 09:53:36,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:53:36,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:53:36,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:53:36,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:53:36,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,840 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:53:36,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:53:36,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:53:36,845 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:53:36,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (1/1) ... [2023-09-01 09:53:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:53:36,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:53:36,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:53:36,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:53:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:53:36,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:53:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:53:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:53:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:53:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:53:36,902 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:53:36,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:53:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:53:36,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:53:36,911 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:53:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:53:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:53:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:53:36,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:53:36,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:53:36,913 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:53:37,038 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:53:37,040 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:53:37,406 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:53:37,596 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:53:37,596 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:53:37,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:37 BoogieIcfgContainer [2023-09-01 09:53:37,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:53:37,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:53:37,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:53:37,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:53:37,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:53:36" (1/3) ... [2023-09-01 09:53:37,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e895327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:37, skipping insertion in model container [2023-09-01 09:53:37,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:53:36" (2/3) ... [2023-09-01 09:53:37,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e895327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:53:37, skipping insertion in model container [2023-09-01 09:53:37,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:37" (3/3) ... [2023-09-01 09:53:37,603 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2023-09-01 09:53:37,608 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:53:37,614 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:53:37,614 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:53:37,614 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:53:37,657 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:53:37,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2023-09-01 09:53:37,724 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-09-01 09:53:37,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:37,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-09-01 09:53:37,728 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2023-09-01 09:53:37,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2023-09-01 09:53:37,736 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:53:37,743 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2023-09-01 09:53:37,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2023-09-01 09:53:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2023-09-01 09:53:37,777 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2023-09-01 09:53:37,777 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:37,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-09-01 09:53:37,778 INFO L119 LiptonReduction]: Number of co-enabled transitions 1692 [2023-09-01 09:53:44,598 INFO L134 LiptonReduction]: Checked pairs total: 4188 [2023-09-01 09:53:44,599 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-09-01 09:53:44,614 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:53:44,618 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;@66e18f48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:53:44,619 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-09-01 09:53:44,623 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2023-09-01 09:53:44,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:53:44,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:44,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:44,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:44,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:44,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1725567123, now seen corresponding path program 1 times [2023-09-01 09:53:44,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58540500] [2023-09-01 09:53:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:44,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:45,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58540500] [2023-09-01 09:53:45,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58540500] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:45,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:45,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:53:45,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872122577] [2023-09-01 09:53:45,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:45,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:53:45,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:45,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:53:45,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:53:45,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2023-09-01 09:53:45,039 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,039 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:45,039 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2023-09-01 09:53:45,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:45,269 INFO L130 PetriNetUnfolder]: 511/787 cut-off events. [2023-09-01 09:53:45,269 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-09-01 09:53:45,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 787 events. 511/787 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3422 event pairs, 112 based on Foata normal form. 0/735 useless extension candidates. Maximal degree in co-relation 1595. Up to 580 conditions per place. [2023-09-01 09:53:45,273 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-09-01 09:53:45,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 121 flow [2023-09-01 09:53:45,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:53:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:53:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-09-01 09:53:45,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056022408963585 [2023-09-01 09:53:45,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-09-01 09:53:45,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-09-01 09:53:45,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:45,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-09-01 09:53:45,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,294 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 51 flow. Second operand 3 states and 361 transitions. [2023-09-01 09:53:45,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 121 flow [2023-09-01 09:53:45,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:53:45,297 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 48 flow [2023-09-01 09:53:45,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-09-01 09:53:45,301 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-09-01 09:53:45,301 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 48 flow [2023-09-01 09:53:45,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:45,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:45,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:53:45,302 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:45,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash -412554109, now seen corresponding path program 1 times [2023-09-01 09:53:45,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:45,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258624558] [2023-09-01 09:53:45,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258624558] [2023-09-01 09:53:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258624558] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:53:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926718331] [2023-09-01 09:53:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:45,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:53:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:45,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:53:45,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:53:45,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-09-01 09:53:45,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:45,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-09-01 09:53:45,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:45,745 INFO L130 PetriNetUnfolder]: 545/890 cut-off events. [2023-09-01 09:53:45,745 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-09-01 09:53:45,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 890 events. 545/890 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3992 event pairs, 125 based on Foata normal form. 8/898 useless extension candidates. Maximal degree in co-relation 1822. Up to 775 conditions per place. [2023-09-01 09:53:45,749 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 27 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2023-09-01 09:53:45,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 138 flow [2023-09-01 09:53:45,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:53:45,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:53:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-09-01 09:53:45,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014005602240896 [2023-09-01 09:53:45,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-09-01 09:53:45,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-09-01 09:53:45,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:45,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-09-01 09:53:45,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,753 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 48 flow. Second operand 3 states and 358 transitions. [2023-09-01 09:53:45,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 138 flow [2023-09-01 09:53:45,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:45,754 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 63 flow [2023-09-01 09:53:45,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-09-01 09:53:45,755 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-09-01 09:53:45,755 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 63 flow [2023-09-01 09:53:45,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:45,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:45,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:45,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:53:45,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:45,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 95723769, now seen corresponding path program 1 times [2023-09-01 09:53:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256782448] [2023-09-01 09:53:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256782448] [2023-09-01 09:53:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256782448] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:45,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:45,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:53:45,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668972800] [2023-09-01 09:53:45,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:45,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:53:45,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:53:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:53:46,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 238 [2023-09-01 09:53:46,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:46,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 238 [2023-09-01 09:53:46,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:46,152 INFO L130 PetriNetUnfolder]: 495/801 cut-off events. [2023-09-01 09:53:46,153 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-09-01 09:53:46,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 801 events. 495/801 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3509 event pairs, 145 based on Foata normal form. 12/812 useless extension candidates. Maximal degree in co-relation 1757. Up to 581 conditions per place. [2023-09-01 09:53:46,157 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 28 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-09-01 09:53:46,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 154 flow [2023-09-01 09:53:46,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:53:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:53:46,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-09-01 09:53:46,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5126050420168067 [2023-09-01 09:53:46,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-09-01 09:53:46,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-09-01 09:53:46,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:46,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-09-01 09:53:46,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,163 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 63 flow. Second operand 3 states and 366 transitions. [2023-09-01 09:53:46,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 154 flow [2023-09-01 09:53:46,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:53:46,164 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 68 flow [2023-09-01 09:53:46,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-09-01 09:53:46,164 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-09-01 09:53:46,165 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 68 flow [2023-09-01 09:53:46,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:46,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:46,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:53:46,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:46,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:46,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1327546821, now seen corresponding path program 1 times [2023-09-01 09:53:46,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:46,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445316652] [2023-09-01 09:53:46,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:46,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:46,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445316652] [2023-09-01 09:53:46,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445316652] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:46,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:53:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492528650] [2023-09-01 09:53:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:46,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:53:46,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:46,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:53:46,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:53:46,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-09-01 09:53:46,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:46,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-09-01 09:53:46,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:46,608 INFO L130 PetriNetUnfolder]: 540/851 cut-off events. [2023-09-01 09:53:46,608 INFO L131 PetriNetUnfolder]: For 272/273 co-relation queries the response was YES. [2023-09-01 09:53:46,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2027 conditions, 851 events. 540/851 cut-off events. For 272/273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3553 event pairs, 176 based on Foata normal form. 20/870 useless extension candidates. Maximal degree in co-relation 2014. Up to 580 conditions per place. [2023-09-01 09:53:46,614 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-09-01 09:53:46,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 147 flow [2023-09-01 09:53:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:53:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:53:46,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-09-01 09:53:46,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014005602240896 [2023-09-01 09:53:46,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-09-01 09:53:46,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-09-01 09:53:46,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:46,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-09-01 09:53:46,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,623 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 68 flow. Second operand 3 states and 358 transitions. [2023-09-01 09:53:46,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 147 flow [2023-09-01 09:53:46,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 141 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:46,626 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 72 flow [2023-09-01 09:53:46,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-09-01 09:53:46,627 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2023-09-01 09:53:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 72 flow [2023-09-01 09:53:46,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:46,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:46,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:46,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:53:46,627 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:46,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -196912279, now seen corresponding path program 1 times [2023-09-01 09:53:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109263050] [2023-09-01 09:53:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:47,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:47,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109263050] [2023-09-01 09:53:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109263050] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:47,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064468307] [2023-09-01 09:53:47,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:47,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:53:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:47,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:53:47,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:53:47,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 238 [2023-09-01 09:53:47,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 72 flow. Second operand has 7 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:47,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:47,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 238 [2023-09-01 09:53:47,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:48,004 INFO L130 PetriNetUnfolder]: 493/797 cut-off events. [2023-09-01 09:53:48,005 INFO L131 PetriNetUnfolder]: For 322/322 co-relation queries the response was YES. [2023-09-01 09:53:48,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 797 events. 493/797 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3442 event pairs, 43 based on Foata normal form. 18/814 useless extension candidates. Maximal degree in co-relation 1847. Up to 487 conditions per place. [2023-09-01 09:53:48,008 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 38 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2023-09-01 09:53:48,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 227 flow [2023-09-01 09:53:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:53:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:53:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-09-01 09:53:48,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647058823529412 [2023-09-01 09:53:48,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-09-01 09:53:48,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-09-01 09:53:48,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:48,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-09-01 09:53:48,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,014 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 72 flow. Second operand 5 states and 553 transitions. [2023-09-01 09:53:48,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 227 flow [2023-09-01 09:53:48,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:48,017 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 107 flow [2023-09-01 09:53:48,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-09-01 09:53:48,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-09-01 09:53:48,018 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 107 flow [2023-09-01 09:53:48,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:48,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:48,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:53:48,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:48,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:48,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1132890377, now seen corresponding path program 1 times [2023-09-01 09:53:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:48,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103669500] [2023-09-01 09:53:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:48,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:48,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103669500] [2023-09-01 09:53:48,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103669500] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:53:48,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041739698] [2023-09-01 09:53:48,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:48,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:53:48,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:48,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:53:48,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:53:48,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-09-01 09:53:48,272 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,272 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:48,272 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-09-01 09:53:48,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:48,427 INFO L130 PetriNetUnfolder]: 394/684 cut-off events. [2023-09-01 09:53:48,427 INFO L131 PetriNetUnfolder]: For 600/601 co-relation queries the response was YES. [2023-09-01 09:53:48,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 684 events. 394/684 cut-off events. For 600/601 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3152 event pairs, 67 based on Foata normal form. 71/752 useless extension candidates. Maximal degree in co-relation 1969. Up to 398 conditions per place. [2023-09-01 09:53:48,430 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 54 selfloop transitions, 7 changer transitions 5/69 dead transitions. [2023-09-01 09:53:48,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 69 transitions, 418 flow [2023-09-01 09:53:48,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:53:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:53:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-09-01 09:53:48,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4773109243697479 [2023-09-01 09:53:48,432 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-09-01 09:53:48,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-09-01 09:53:48,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:48,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-09-01 09:53:48,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,435 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,435 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 107 flow. Second operand 5 states and 568 transitions. [2023-09-01 09:53:48,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 69 transitions, 418 flow [2023-09-01 09:53:48,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 405 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:53:48,437 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 157 flow [2023-09-01 09:53:48,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-09-01 09:53:48,438 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-09-01 09:53:48,438 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 157 flow [2023-09-01 09:53:48,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:48,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:48,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:48,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:53:48,439 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:48,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:48,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2099250908, now seen corresponding path program 1 times [2023-09-01 09:53:48,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371076583] [2023-09-01 09:53:48,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:48,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:49,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:49,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:49,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371076583] [2023-09-01 09:53:49,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371076583] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:49,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 09:53:49,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054518930] [2023-09-01 09:53:49,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:49,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 09:53:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 09:53:49,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-09-01 09:53:49,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2023-09-01 09:53:49,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 157 flow. Second operand has 9 states, 9 states have (on average 100.55555555555556) internal successors, (905), 9 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:49,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:49,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2023-09-01 09:53:49,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:50,060 INFO L130 PetriNetUnfolder]: 460/813 cut-off events. [2023-09-01 09:53:50,060 INFO L131 PetriNetUnfolder]: For 1112/1112 co-relation queries the response was YES. [2023-09-01 09:53:50,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2926 conditions, 813 events. 460/813 cut-off events. For 1112/1112 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4008 event pairs, 41 based on Foata normal form. 4/813 useless extension candidates. Maximal degree in co-relation 2905. Up to 477 conditions per place. [2023-09-01 09:53:50,064 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 67 selfloop transitions, 17 changer transitions 7/94 dead transitions. [2023-09-01 09:53:50,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 94 transitions, 652 flow [2023-09-01 09:53:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:53:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:53:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 850 transitions. [2023-09-01 09:53:50,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44642857142857145 [2023-09-01 09:53:50,067 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 850 transitions. [2023-09-01 09:53:50,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 850 transitions. [2023-09-01 09:53:50,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:50,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 850 transitions. [2023-09-01 09:53:50,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.25) internal successors, (850), 8 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,071 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,071 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 157 flow. Second operand 8 states and 850 transitions. [2023-09-01 09:53:50,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 94 transitions, 652 flow [2023-09-01 09:53:50,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 94 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:53:50,076 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 270 flow [2023-09-01 09:53:50,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=270, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-09-01 09:53:50,076 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2023-09-01 09:53:50,078 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 270 flow [2023-09-01 09:53:50,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 100.55555555555556) internal successors, (905), 9 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:50,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:50,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:53:50,079 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:50,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2011668796, now seen corresponding path program 1 times [2023-09-01 09:53:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600868859] [2023-09-01 09:53:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600868859] [2023-09-01 09:53:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600868859] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:50,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:53:50,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235269197] [2023-09-01 09:53:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:50,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:53:50,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:53:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:53:50,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-09-01 09:53:50,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:50,282 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-09-01 09:53:50,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:50,445 INFO L130 PetriNetUnfolder]: 301/558 cut-off events. [2023-09-01 09:53:50,446 INFO L131 PetriNetUnfolder]: For 1373/1373 co-relation queries the response was YES. [2023-09-01 09:53:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 558 events. 301/558 cut-off events. For 1373/1373 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2664 event pairs, 35 based on Foata normal form. 52/606 useless extension candidates. Maximal degree in co-relation 2171. Up to 217 conditions per place. [2023-09-01 09:53:50,449 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 87 selfloop transitions, 11 changer transitions 16/117 dead transitions. [2023-09-01 09:53:50,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 117 transitions, 952 flow [2023-09-01 09:53:50,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:53:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:53:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 792 transitions. [2023-09-01 09:53:50,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47539015606242496 [2023-09-01 09:53:50,451 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 792 transitions. [2023-09-01 09:53:50,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 792 transitions. [2023-09-01 09:53:50,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:50,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 792 transitions. [2023-09-01 09:53:50,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.14285714285714) internal successors, (792), 7 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,455 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,455 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 270 flow. Second operand 7 states and 792 transitions. [2023-09-01 09:53:50,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 117 transitions, 952 flow [2023-09-01 09:53:50,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 117 transitions, 917 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-09-01 09:53:50,459 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 338 flow [2023-09-01 09:53:50,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-09-01 09:53:50,459 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 27 predicate places. [2023-09-01 09:53:50,460 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 338 flow [2023-09-01 09:53:50,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:50,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:50,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:53:50,460 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:50,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:50,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1043303351, now seen corresponding path program 1 times [2023-09-01 09:53:50,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:50,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722299066] [2023-09-01 09:53:50,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:50,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722299066] [2023-09-01 09:53:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722299066] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:53:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151954455] [2023-09-01 09:53:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:50,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:53:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:53:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:53:50,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-09-01 09:53:50,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:50,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-09-01 09:53:50,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:50,882 INFO L130 PetriNetUnfolder]: 270/510 cut-off events. [2023-09-01 09:53:50,882 INFO L131 PetriNetUnfolder]: For 1435/1435 co-relation queries the response was YES. [2023-09-01 09:53:50,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 510 events. 270/510 cut-off events. For 1435/1435 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2480 event pairs, 32 based on Foata normal form. 14/520 useless extension candidates. Maximal degree in co-relation 2196. Up to 199 conditions per place. [2023-09-01 09:53:50,885 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 76 selfloop transitions, 15 changer transitions 15/109 dead transitions. [2023-09-01 09:53:50,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 109 transitions, 903 flow [2023-09-01 09:53:50,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:53:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:53:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1000 transitions. [2023-09-01 09:53:50,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668534080298786 [2023-09-01 09:53:50,888 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1000 transitions. [2023-09-01 09:53:50,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1000 transitions. [2023-09-01 09:53:50,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:50,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1000 transitions. [2023-09-01 09:53:50,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.11111111111111) internal successors, (1000), 9 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,893 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,893 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 338 flow. Second operand 9 states and 1000 transitions. [2023-09-01 09:53:50,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 109 transitions, 903 flow [2023-09-01 09:53:50,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 109 transitions, 810 flow, removed 17 selfloop flow, removed 7 redundant places. [2023-09-01 09:53:50,899 INFO L231 Difference]: Finished difference. Result has 61 places, 40 transitions, 267 flow [2023-09-01 09:53:50,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=61, PETRI_TRANSITIONS=40} [2023-09-01 09:53:50,900 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2023-09-01 09:53:50,900 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 40 transitions, 267 flow [2023-09-01 09:53:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:50,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:50,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:50,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:53:50,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:50,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:50,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1808435046, now seen corresponding path program 1 times [2023-09-01 09:53:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:50,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475154479] [2023-09-01 09:53:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:50,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:53:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:53:51,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:53:51,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475154479] [2023-09-01 09:53:51,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475154479] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:53:51,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:53:51,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:53:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842735442] [2023-09-01 09:53:51,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:53:51,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:53:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:53:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:53:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:53:51,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-09-01 09:53:51,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 40 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:51,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:53:51,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-09-01 09:53:51,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:53:51,541 INFO L130 PetriNetUnfolder]: 337/680 cut-off events. [2023-09-01 09:53:51,541 INFO L131 PetriNetUnfolder]: For 1812/1813 co-relation queries the response was YES. [2023-09-01 09:53:51,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 680 events. 337/680 cut-off events. For 1812/1813 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3766 event pairs, 118 based on Foata normal form. 1/677 useless extension candidates. Maximal degree in co-relation 2954. Up to 365 conditions per place. [2023-09-01 09:53:51,545 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 63 selfloop transitions, 11 changer transitions 13/90 dead transitions. [2023-09-01 09:53:51,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 855 flow [2023-09-01 09:53:51,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:53:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:53:51,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions. [2023-09-01 09:53:51,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46008403361344535 [2023-09-01 09:53:51,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions. [2023-09-01 09:53:51,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions. [2023-09-01 09:53:51,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:53:51,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions. [2023-09-01 09:53:51,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:51,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:51,551 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:51,551 INFO L175 Difference]: Start difference. First operand has 61 places, 40 transitions, 267 flow. Second operand 6 states and 657 transitions. [2023-09-01 09:53:51,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 855 flow [2023-09-01 09:53:51,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 685 flow, removed 44 selfloop flow, removed 7 redundant places. [2023-09-01 09:53:51,558 INFO L231 Difference]: Finished difference. Result has 62 places, 45 transitions, 295 flow [2023-09-01 09:53:51,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2023-09-01 09:53:51,559 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2023-09-01 09:53:51,559 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 295 flow [2023-09-01 09:53:51,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:53:51,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:53:51,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:51,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:53:51,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-09-01 09:53:51,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:53:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2099964626, now seen corresponding path program 2 times [2023-09-01 09:53:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:53:51,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247047683] [2023-09-01 09:53:51,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:53:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:53:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:53:51,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:53:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:53:51,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:53:51,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:53:51,683 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-09-01 09:53:51,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-09-01 09:53:51,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-09-01 09:53:51,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-09-01 09:53:51,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-09-01 09:53:51,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-09-01 09:53:51,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:53:51,685 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:53:51,689 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:53:51,689 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:53:51,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:53:51 BasicIcfg [2023-09-01 09:53:51,750 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:53:51,750 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:53:51,750 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:53:51,751 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:53:51,751 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:53:37" (3/4) ... [2023-09-01 09:53:51,752 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:53:51,810 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:53:51,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:53:51,810 INFO L158 Benchmark]: Toolchain (without parser) took 15513.33ms. Allocated memory was 75.5MB in the beginning and 406.8MB in the end (delta: 331.4MB). Free memory was 46.9MB in the beginning and 217.0MB in the end (delta: -170.1MB). Peak memory consumption was 162.2MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,810 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 34.1MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:53:51,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.81ms. Allocated memory is still 75.5MB. Free memory was 46.6MB in the beginning and 39.3MB in the end (delta: 7.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.14ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 36.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,811 INFO L158 Benchmark]: Boogie Preprocessor took 33.99ms. Allocated memory is still 75.5MB. Free memory was 36.5MB in the beginning and 34.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,811 INFO L158 Benchmark]: RCFGBuilder took 753.47ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 59.8MB in the end (delta: -25.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,811 INFO L158 Benchmark]: TraceAbstraction took 14150.88ms. Allocated memory was 92.3MB in the beginning and 406.8MB in the end (delta: 314.6MB). Free memory was 59.2MB in the beginning and 231.6MB in the end (delta: -172.4MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,811 INFO L158 Benchmark]: Witness Printer took 59.47ms. Allocated memory is still 406.8MB. Free memory was 231.6MB in the beginning and 217.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:53:51,812 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.66ms. Allocated memory is still 56.6MB. Free memory was 34.2MB in the beginning and 34.1MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.81ms. Allocated memory is still 75.5MB. Free memory was 46.6MB in the beginning and 39.3MB in the end (delta: 7.3MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.14ms. Allocated memory is still 75.5MB. Free memory was 39.3MB in the beginning and 36.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.99ms. Allocated memory is still 75.5MB. Free memory was 36.5MB in the beginning and 34.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 753.47ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 34.1MB in the beginning and 59.8MB in the end (delta: -25.7MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14150.88ms. Allocated memory was 92.3MB in the beginning and 406.8MB in the end (delta: 314.6MB). Free memory was 59.2MB in the beginning and 231.6MB in the end (delta: -172.4MB). Peak memory consumption was 142.4MB. Max. memory is 16.1GB. * Witness Printer took 59.47ms. Allocated memory is still 406.8MB. Free memory was 231.6MB in the beginning and 217.0MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 130 PlacesBefore, 31 PlacesAfterwards, 122 TransitionsBefore, 21 TransitionsAfterwards, 1692 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, 4188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1602, independent: 1436, independent conditional: 0, independent unconditional: 1436, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 922, independent: 880, independent conditional: 0, independent unconditional: 880, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1602, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 922, unknown conditional: 0, unknown unconditional: 922] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1684, ((void *)0), P0, ((void *)0))=-3, t1684={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L859] 0 pthread_t t1685; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L860] FCALL, FORK 0 pthread_create(&t1685, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1685, ((void *)0), P1, ((void *)0))=-2, t1684={7:0}, t1685={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L861] 0 pthread_t t1686; [L792] 2 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L862] FCALL, FORK 0 pthread_create(&t1686, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1686, ((void *)0), P2, ((void *)0))=-1, t1684={7:0}, t1685={5:0}, t1686={6:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 2 return 0; [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 3 return 0; [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684={7:0}, t1685={5:0}, t1686={6:0}, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 19]: 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: 860]: 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: 862]: 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: 858]: 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 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.0s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1329 IncrementalHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 56 mSDtfsCounter, 1329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=338occurred in iteration=8, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 1052 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:53:51,830 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