./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.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/safe014_rmo.oepc.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 bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa --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:56:18,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:56:18,995 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:56:19,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:56:19,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:56:19,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:56:19,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:56:19,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:56:19,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:56:19,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:56:19,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:56:19,056 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:56:19,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:56:19,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:56:19,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:56:19,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:56:19,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:56:19,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:56:19,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:56:19,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:56:19,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:56:19,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:56:19,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:56:19,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:56:19,091 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:56:19,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:56:19,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:56:19,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:56:19,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:56:19,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:56:19,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:56:19,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:56:19,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:56:19,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:56:19,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:56:19,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:56:19,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:56:19,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:56:19,100 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:56:19,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:56:19,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:56:19,103 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:56:19,131 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:56:19,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:56:19,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:56:19,132 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:56:19,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:56:19,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:56:19,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:56:19,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:56:19,134 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:56:19,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:56:19,135 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:56:19,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:56:19,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:56:19,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:56:19,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:56:19,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:56:19,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:56:19,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:56:19,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:56:19,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:56:19,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:56:19,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:56:19,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:56:19,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:56:19,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:56:19,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:56:19,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:56:19,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:56:19,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:56:19,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:56:19,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:56:19,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:56:19,138 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:56:19,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:56:19,138 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:56:19,139 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 -> bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa 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:56:19,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:56:19,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:56:19,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:56:19,440 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:56:19,440 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:56:19,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2023-09-01 09:56:20,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:56:20,911 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:56:20,912 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2023-09-01 09:56:20,939 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1906ce2c/b0b9928bfc174aa8837f0ec528fc3e2a/FLAG5f32c57ae [2023-09-01 09:56:20,957 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1906ce2c/b0b9928bfc174aa8837f0ec528fc3e2a [2023-09-01 09:56:20,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:56:20,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:56:20,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:56:20,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:56:20,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:56:20,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:56:20" (1/1) ... [2023-09-01 09:56:20,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a97bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:20, skipping insertion in model container [2023-09-01 09:56:20,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:56:20" (1/1) ... [2023-09-01 09:56:20,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:56:21,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:56:21,202 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/safe014_rmo.oepc.i[993,1006] [2023-09-01 09:56:21,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:56:21,426 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:56:21,437 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/safe014_rmo.oepc.i[993,1006] [2023-09-01 09:56:21,496 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:56:21,535 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:56:21,536 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:56:21,542 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:56:21,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21 WrapperNode [2023-09-01 09:56:21,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:56:21,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:56:21,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:56:21,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:56:21,550 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:56:21" (1/1) ... [2023-09-01 09:56:21,580 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:56:21" (1/1) ... [2023-09-01 09:56:21,614 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-09-01 09:56:21,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:56:21,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:56:21,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:56:21,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:56:21,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,661 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:56:21,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:56:21,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:56:21,673 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:56:21,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (1/1) ... [2023-09-01 09:56:21,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:56:21,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:56:21,702 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:56:21,721 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:56:21,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:56:21,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:56:21,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:56:21,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:56:21,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:56:21,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:56:21,746 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:56:21,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:56:21,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:56:21,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:56:21,748 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:56:21,920 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:56:21,928 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:56:22,232 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:56:22,403 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:56:22,403 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:56:22,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:56:22 BoogieIcfgContainer [2023-09-01 09:56:22,406 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:56:22,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:56:22,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:56:22,410 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:56:22,410 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:56:20" (1/3) ... [2023-09-01 09:56:22,410 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1464286d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:56:22, skipping insertion in model container [2023-09-01 09:56:22,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:56:21" (2/3) ... [2023-09-01 09:56:22,411 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1464286d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:56:22, skipping insertion in model container [2023-09-01 09:56:22,411 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:56:22" (3/3) ... [2023-09-01 09:56:22,412 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2023-09-01 09:56:22,418 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:56:22,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:56:22,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 09:56:22,426 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:56:22,482 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:56:22,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2023-09-01 09:56:22,552 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-09-01 09:56:22,552 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:56:22,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-09-01 09:56:22,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2023-09-01 09:56:22,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2023-09-01 09:56:22,563 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:56:22,570 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2023-09-01 09:56:22,572 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2023-09-01 09:56:22,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2023-09-01 09:56:22,594 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2023-09-01 09:56:22,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:56:22,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-09-01 09:56:22,596 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-09-01 09:56:27,557 INFO L134 LiptonReduction]: Checked pairs total: 3106 [2023-09-01 09:56:27,558 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-09-01 09:56:27,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:56:27,571 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;@52badbe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:56:27,572 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 09:56:27,577 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2023-09-01 09:56:27,579 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:56:27,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:27,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:27,581 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:27,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1646385034, now seen corresponding path program 1 times [2023-09-01 09:56:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:27,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005621068] [2023-09-01 09:56:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:28,086 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:56:28,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:28,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005621068] [2023-09-01 09:56:28,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005621068] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:28,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:56:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109051120] [2023-09-01 09:56:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:56:28,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:28,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:56:28,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:56:28,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 217 [2023-09-01 09:56:28,131 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:56:28,131 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:28,131 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 217 [2023-09-01 09:56:28,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:28,251 INFO L130 PetriNetUnfolder]: 264/473 cut-off events. [2023-09-01 09:56:28,252 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-09-01 09:56:28,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 473 events. 264/473 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2254 event pairs, 56 based on Foata normal form. 12/481 useless extension candidates. Maximal degree in co-relation 914. Up to 333 conditions per place. [2023-09-01 09:56:28,255 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 25 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-09-01 09:56:28,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 129 flow [2023-09-01 09:56:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:56:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:56:28,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 09:56:28,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5683563748079877 [2023-09-01 09:56:28,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 09:56:28,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 09:56:28,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:28,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 09:56:28,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 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:56:28,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:28,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:28,277 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 370 transitions. [2023-09-01 09:56:28,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 129 flow [2023-09-01 09:56:28,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:56:28,280 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2023-09-01 09:56:28,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2023-09-01 09:56:28,283 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2023-09-01 09:56:28,283 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2023-09-01 09:56:28,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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:56:28,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:28,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:56:28,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:28,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 501670543, now seen corresponding path program 1 times [2023-09-01 09:56:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:28,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743339679] [2023-09-01 09:56:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:28,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:28,430 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:56:28,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:28,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743339679] [2023-09-01 09:56:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743339679] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:28,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:28,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:56:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664893790] [2023-09-01 09:56:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:28,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:56:28,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:28,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:56:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:56:28,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 217 [2023-09-01 09:56:28,438 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:56:28,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:28,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 217 [2023-09-01 09:56:28,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:28,519 INFO L130 PetriNetUnfolder]: 349/556 cut-off events. [2023-09-01 09:56:28,519 INFO L131 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2023-09-01 09:56:28,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 556 events. 349/556 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2221 event pairs, 112 based on Foata normal form. 8/560 useless extension candidates. Maximal degree in co-relation 1270. Up to 452 conditions per place. [2023-09-01 09:56:28,522 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-09-01 09:56:28,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 127 flow [2023-09-01 09:56:28,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:56:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:56:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-09-01 09:56:28,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5529953917050692 [2023-09-01 09:56:28,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-09-01 09:56:28,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-09-01 09:56:28,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:28,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-09-01 09:56:28,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:28,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:28,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:28,535 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 3 states and 360 transitions. [2023-09-01 09:56:28,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 127 flow [2023-09-01 09:56:28,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:28,536 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 56 flow [2023-09-01 09:56:28,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-09-01 09:56:28,537 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2023-09-01 09:56:28,537 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2023-09-01 09:56:28,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 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:56:28,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:28,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:28,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:56:28,538 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:28,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1011506753, now seen corresponding path program 1 times [2023-09-01 09:56:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498883422] [2023-09-01 09:56:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:28,682 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:56:28,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:28,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498883422] [2023-09-01 09:56:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498883422] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:28,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:28,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:56:28,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586574387] [2023-09-01 09:56:28,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:28,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:56:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:56:28,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:56:28,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 217 [2023-09-01 09:56:28,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:56:28,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:28,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 217 [2023-09-01 09:56:28,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:28,787 INFO L130 PetriNetUnfolder]: 331/536 cut-off events. [2023-09-01 09:56:28,787 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-09-01 09:56:28,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 536 events. 331/536 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2186 event pairs, 215 based on Foata normal form. 8/531 useless extension candidates. Maximal degree in co-relation 1258. Up to 396 conditions per place. [2023-09-01 09:56:28,790 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-09-01 09:56:28,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 129 flow [2023-09-01 09:56:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:56:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:56:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-09-01 09:56:28,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5529953917050692 [2023-09-01 09:56:28,791 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-09-01 09:56:28,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-09-01 09:56:28,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:28,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-09-01 09:56:28,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:28,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:28,794 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:28,794 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 3 states and 360 transitions. [2023-09-01 09:56:28,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 129 flow [2023-09-01 09:56:28,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 28 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:28,796 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 60 flow [2023-09-01 09:56:28,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-09-01 09:56:28,796 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2023-09-01 09:56:28,797 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 60 flow [2023-09-01 09:56:28,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:56:28,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:28,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:28,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:56:28,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:28,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:28,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1828962361, now seen corresponding path program 1 times [2023-09-01 09:56:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:28,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192922767] [2023-09-01 09:56:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:56:28,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:28,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192922767] [2023-09-01 09:56:28,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192922767] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:28,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:28,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:56:28,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598285812] [2023-09-01 09:56:28,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:28,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:56:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:56:28,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:56:28,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 217 [2023-09-01 09:56:28,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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:56:28,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:28,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 217 [2023-09-01 09:56:28,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:29,023 INFO L130 PetriNetUnfolder]: 238/418 cut-off events. [2023-09-01 09:56:29,024 INFO L131 PetriNetUnfolder]: For 204/204 co-relation queries the response was YES. [2023-09-01 09:56:29,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 418 events. 238/418 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1761 event pairs, 64 based on Foata normal form. 4/418 useless extension candidates. Maximal degree in co-relation 997. Up to 276 conditions per place. [2023-09-01 09:56:29,027 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 20 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-09-01 09:56:29,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 25 transitions, 121 flow [2023-09-01 09:56:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:56:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:56:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-09-01 09:56:29,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514592933947773 [2023-09-01 09:56:29,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-09-01 09:56:29,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-09-01 09:56:29,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:29,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-09-01 09:56:29,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:56:29,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:29,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 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:56:29,035 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 60 flow. Second operand 3 states and 359 transitions. [2023-09-01 09:56:29,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 25 transitions, 121 flow [2023-09-01 09:56:29,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:29,037 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 64 flow [2023-09-01 09:56:29,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2023-09-01 09:56:29,038 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-09-01 09:56:29,038 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 64 flow [2023-09-01 09:56:29,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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:56:29,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:29,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:29,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:56:29,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:29,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:29,040 INFO L85 PathProgramCache]: Analyzing trace with hash -447511137, now seen corresponding path program 1 times [2023-09-01 09:56:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958094906] [2023-09-01 09:56:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:29,189 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:56:29,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958094906] [2023-09-01 09:56:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958094906] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439172623] [2023-09-01 09:56:29,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:29,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:29,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:29,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:29,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:29,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:56:29,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:29,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:29,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:29,341 INFO L130 PetriNetUnfolder]: 458/749 cut-off events. [2023-09-01 09:56:29,342 INFO L131 PetriNetUnfolder]: For 253/253 co-relation queries the response was YES. [2023-09-01 09:56:29,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 749 events. 458/749 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3490 event pairs, 207 based on Foata normal form. 12/748 useless extension candidates. Maximal degree in co-relation 1817. Up to 384 conditions per place. [2023-09-01 09:56:29,345 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 23 selfloop transitions, 2 changer transitions 15/42 dead transitions. [2023-09-01 09:56:29,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 199 flow [2023-09-01 09:56:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:56:29,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:56:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-09-01 09:56:29,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5400921658986175 [2023-09-01 09:56:29,347 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-09-01 09:56:29,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-09-01 09:56:29,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:29,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-09-01 09:56:29,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 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:56:29,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 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:56:29,351 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 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:56:29,351 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 64 flow. Second operand 5 states and 586 transitions. [2023-09-01 09:56:29,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 199 flow [2023-09-01 09:56:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:29,352 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 70 flow [2023-09-01 09:56:29,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2023-09-01 09:56:29,353 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-09-01 09:56:29,353 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 70 flow [2023-09-01 09:56:29,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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:56:29,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:29,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:29,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:56:29,354 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:29,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash -863301117, now seen corresponding path program 2 times [2023-09-01 09:56:29,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:29,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713598634] [2023-09-01 09:56:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:29,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:30,082 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:56:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:30,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713598634] [2023-09-01 09:56:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713598634] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:30,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:30,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:56:30,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275322981] [2023-09-01 09:56:30,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:30,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:56:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:30,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:56:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:56:30,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 217 [2023-09-01 09:56:30,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 19 transitions, 70 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:56:30,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:30,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 217 [2023-09-01 09:56:30,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:30,303 INFO L130 PetriNetUnfolder]: 332/563 cut-off events. [2023-09-01 09:56:30,303 INFO L131 PetriNetUnfolder]: For 560/562 co-relation queries the response was YES. [2023-09-01 09:56:30,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1427 conditions, 563 events. 332/563 cut-off events. For 560/562 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2391 event pairs, 36 based on Foata normal form. 5/567 useless extension candidates. Maximal degree in co-relation 1412. Up to 339 conditions per place. [2023-09-01 09:56:30,306 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 29 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-09-01 09:56:30,306 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 186 flow [2023-09-01 09:56:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:56:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:56:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-09-01 09:56:30,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230414746543779 [2023-09-01 09:56:30,308 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-09-01 09:56:30,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-09-01 09:56:30,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:30,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-09-01 09:56:30,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 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:56:30,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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:56:30,310 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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:56:30,310 INFO L175 Difference]: Start difference. First operand has 36 places, 19 transitions, 70 flow. Second operand 4 states and 454 transitions. [2023-09-01 09:56:30,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 186 flow [2023-09-01 09:56:30,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 176 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-09-01 09:56:30,313 INFO L231 Difference]: Finished difference. Result has 36 places, 21 transitions, 86 flow [2023-09-01 09:56:30,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=21} [2023-09-01 09:56:30,317 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2023-09-01 09:56:30,317 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 86 flow [2023-09-01 09:56:30,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:56:30,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:30,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:30,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:56:30,318 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:30,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -6377011, now seen corresponding path program 1 times [2023-09-01 09:56:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890798647] [2023-09-01 09:56:30,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:30,531 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:56:30,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:30,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890798647] [2023-09-01 09:56:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890798647] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:30,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:30,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123809200] [2023-09-01 09:56:30,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:30,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:30,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:30,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:30,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:30,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 21 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:56:30,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:30,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:30,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:30,654 INFO L130 PetriNetUnfolder]: 264/481 cut-off events. [2023-09-01 09:56:30,654 INFO L131 PetriNetUnfolder]: For 402/404 co-relation queries the response was YES. [2023-09-01 09:56:30,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 481 events. 264/481 cut-off events. For 402/404 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2181 event pairs, 52 based on Foata normal form. 53/528 useless extension candidates. Maximal degree in co-relation 1296. Up to 286 conditions per place. [2023-09-01 09:56:30,656 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 36 selfloop transitions, 7 changer transitions 3/50 dead transitions. [2023-09-01 09:56:30,656 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 282 flow [2023-09-01 09:56:30,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:56:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:56:30,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-09-01 09:56:30,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2023-09-01 09:56:30,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-09-01 09:56:30,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-09-01 09:56:30,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:30,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-09-01 09:56:30,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:56:30,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 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:56:30,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 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:56:30,661 INFO L175 Difference]: Start difference. First operand has 36 places, 21 transitions, 86 flow. Second operand 5 states and 589 transitions. [2023-09-01 09:56:30,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 282 flow [2023-09-01 09:56:30,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:56:30,662 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 137 flow [2023-09-01 09:56:30,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-09-01 09:56:30,663 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2023-09-01 09:56:30,663 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 137 flow [2023-09-01 09:56:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:56:30,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:30,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:30,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:56:30,663 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:30,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -978715206, now seen corresponding path program 1 times [2023-09-01 09:56:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495523262] [2023-09-01 09:56:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:30,895 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:56:30,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:30,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495523262] [2023-09-01 09:56:30,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495523262] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:30,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:30,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:56:30,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833251046] [2023-09-01 09:56:30,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:30,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:56:30,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:56:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:56:30,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:30,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:56:30,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:30,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:30,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:31,053 INFO L130 PetriNetUnfolder]: 196/387 cut-off events. [2023-09-01 09:56:31,053 INFO L131 PetriNetUnfolder]: For 501/503 co-relation queries the response was YES. [2023-09-01 09:56:31,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 387 events. 196/387 cut-off events. For 501/503 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1744 event pairs, 23 based on Foata normal form. 32/413 useless extension candidates. Maximal degree in co-relation 1356. Up to 149 conditions per place. [2023-09-01 09:56:31,055 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 41 selfloop transitions, 13 changer transitions 8/66 dead transitions. [2023-09-01 09:56:31,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 443 flow [2023-09-01 09:56:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:56:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:56:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 823 transitions. [2023-09-01 09:56:31,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5418038183015141 [2023-09-01 09:56:31,057 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 823 transitions. [2023-09-01 09:56:31,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 823 transitions. [2023-09-01 09:56:31,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:31,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 823 transitions. [2023-09-01 09:56:31,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.57142857142857) internal successors, (823), 7 states have internal predecessors, (823), 0 states have call successors, (0), 0 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:56:31,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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:56:31,060 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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:56:31,060 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 137 flow. Second operand 7 states and 823 transitions. [2023-09-01 09:56:31,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 443 flow [2023-09-01 09:56:31,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:56:31,062 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 221 flow [2023-09-01 09:56:31,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=221, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2023-09-01 09:56:31,063 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2023-09-01 09:56:31,063 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 221 flow [2023-09-01 09:56:31,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:56:31,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:31,063 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:56:31,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:56:31,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:31,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1697346538, now seen corresponding path program 1 times [2023-09-01 09:56:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:31,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685232717] [2023-09-01 09:56:31,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:31,226 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:56:31,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:31,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685232717] [2023-09-01 09:56:31,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685232717] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:31,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:31,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344503562] [2023-09-01 09:56:31,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:31,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:31,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:31,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:31,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:31,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:31,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:56:31,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:31,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:31,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:31,367 INFO L130 PetriNetUnfolder]: 370/687 cut-off events. [2023-09-01 09:56:31,367 INFO L131 PetriNetUnfolder]: For 1625/1625 co-relation queries the response was YES. [2023-09-01 09:56:31,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 687 events. 370/687 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3325 event pairs, 110 based on Foata normal form. 6/684 useless extension candidates. Maximal degree in co-relation 2713. Up to 285 conditions per place. [2023-09-01 09:56:31,371 INFO L137 encePairwiseOnDemand]: 214/217 looper letters, 37 selfloop transitions, 2 changer transitions 32/73 dead transitions. [2023-09-01 09:56:31,371 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 73 transitions, 649 flow [2023-09-01 09:56:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:56:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:56:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-09-01 09:56:31,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460829493087558 [2023-09-01 09:56:31,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-09-01 09:56:31,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-09-01 09:56:31,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:31,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-09-01 09:56:31,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 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:56:31,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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:56:31,376 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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:56:31,376 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 221 flow. Second operand 4 states and 474 transitions. [2023-09-01 09:56:31,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 73 transitions, 649 flow [2023-09-01 09:56:31,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 73 transitions, 566 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-09-01 09:56:31,384 INFO L231 Difference]: Finished difference. Result has 53 places, 28 transitions, 164 flow [2023-09-01 09:56:31,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=53, PETRI_TRANSITIONS=28} [2023-09-01 09:56:31,385 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2023-09-01 09:56:31,385 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 164 flow [2023-09-01 09:56:31,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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:56:31,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:31,385 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:56:31,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:56:31,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:31,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:31,386 INFO L85 PathProgramCache]: Analyzing trace with hash -939436272, now seen corresponding path program 2 times [2023-09-01 09:56:31,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:31,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873106765] [2023-09-01 09:56:31,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:31,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:31,531 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:56:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873106765] [2023-09-01 09:56:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873106765] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:31,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:56:31,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885368668] [2023-09-01 09:56:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:31,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:31,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:31,538 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 28 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 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:56:31,538 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:31,538 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:31,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:31,663 INFO L130 PetriNetUnfolder]: 211/445 cut-off events. [2023-09-01 09:56:31,663 INFO L131 PetriNetUnfolder]: For 940/950 co-relation queries the response was YES. [2023-09-01 09:56:31,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 445 events. 211/445 cut-off events. For 940/950 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2155 event pairs, 22 based on Foata normal form. 7/445 useless extension candidates. Maximal degree in co-relation 1751. Up to 255 conditions per place. [2023-09-01 09:56:31,666 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 32 selfloop transitions, 3 changer transitions 15/54 dead transitions. [2023-09-01 09:56:31,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 416 flow [2023-09-01 09:56:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:56:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:56:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2023-09-01 09:56:31,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414746543778802 [2023-09-01 09:56:31,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 470 transitions. [2023-09-01 09:56:31,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 470 transitions. [2023-09-01 09:56:31,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:31,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 470 transitions. [2023-09-01 09:56:31,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:56:31,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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:56:31,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 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:56:31,671 INFO L175 Difference]: Start difference. First operand has 53 places, 28 transitions, 164 flow. Second operand 4 states and 470 transitions. [2023-09-01 09:56:31,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 416 flow [2023-09-01 09:56:31,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 393 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-09-01 09:56:31,675 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 165 flow [2023-09-01 09:56:31,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2023-09-01 09:56:31,676 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2023-09-01 09:56:31,676 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 165 flow [2023-09-01 09:56:31,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 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:56:31,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:31,676 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:56:31,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:56:31,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:31,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash 42736652, now seen corresponding path program 3 times [2023-09-01 09:56:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062205611] [2023-09-01 09:56:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:31,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:31,894 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:56:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062205611] [2023-09-01 09:56:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062205611] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:56:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055235885] [2023-09-01 09:56:31,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:31,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:56:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:56:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:56:31,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:31,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 28 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:56:31,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:31,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:31,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:32,007 INFO L130 PetriNetUnfolder]: 87/194 cut-off events. [2023-09-01 09:56:32,007 INFO L131 PetriNetUnfolder]: For 344/363 co-relation queries the response was YES. [2023-09-01 09:56:32,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 194 events. 87/194 cut-off events. For 344/363 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 712 event pairs, 12 based on Foata normal form. 27/213 useless extension candidates. Maximal degree in co-relation 749. Up to 68 conditions per place. [2023-09-01 09:56:32,008 INFO L137 encePairwiseOnDemand]: 211/217 looper letters, 23 selfloop transitions, 10 changer transitions 12/49 dead transitions. [2023-09-01 09:56:32,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 49 transitions, 361 flow [2023-09-01 09:56:32,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:56:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:56:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 807 transitions. [2023-09-01 09:56:32,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5312705727452272 [2023-09-01 09:56:32,011 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 807 transitions. [2023-09-01 09:56:32,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 807 transitions. [2023-09-01 09:56:32,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:32,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 807 transitions. [2023-09-01 09:56:32,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 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:56:32,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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:56:32,015 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 217.0) internal successors, (1736), 8 states have internal predecessors, (1736), 0 states have call successors, (0), 0 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:56:32,016 INFO L175 Difference]: Start difference. First operand has 49 places, 28 transitions, 165 flow. Second operand 7 states and 807 transitions. [2023-09-01 09:56:32,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 49 transitions, 361 flow [2023-09-01 09:56:32,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 302 flow, removed 12 selfloop flow, removed 8 redundant places. [2023-09-01 09:56:32,018 INFO L231 Difference]: Finished difference. Result has 50 places, 26 transitions, 154 flow [2023-09-01 09:56:32,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2023-09-01 09:56:32,018 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2023-09-01 09:56:32,019 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 26 transitions, 154 flow [2023-09-01 09:56:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:56:32,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:32,019 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:56:32,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:56:32,019 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:32,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:32,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1649747409, now seen corresponding path program 1 times [2023-09-01 09:56:32,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:32,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626190777] [2023-09-01 09:56:32,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:32,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:56:32,244 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:56:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:56:32,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626190777] [2023-09-01 09:56:32,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626190777] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:56:32,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:56:32,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:56:32,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997824363] [2023-09-01 09:56:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:56:32,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:56:32,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:56:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:56:32,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:56:32,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 217 [2023-09-01 09:56:32,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 26 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 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:56:32,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:56:32,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 217 [2023-09-01 09:56:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:56:32,343 INFO L130 PetriNetUnfolder]: 134/284 cut-off events. [2023-09-01 09:56:32,343 INFO L131 PetriNetUnfolder]: For 518/518 co-relation queries the response was YES. [2023-09-01 09:56:32,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 284 events. 134/284 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1075 event pairs, 75 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 1089. Up to 185 conditions per place. [2023-09-01 09:56:32,345 INFO L137 encePairwiseOnDemand]: 213/217 looper letters, 25 selfloop transitions, 2 changer transitions 22/50 dead transitions. [2023-09-01 09:56:32,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 398 flow [2023-09-01 09:56:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:56:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:56:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2023-09-01 09:56:32,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364055299539171 [2023-09-01 09:56:32,347 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2023-09-01 09:56:32,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2023-09-01 09:56:32,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:56:32,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2023-09-01 09:56:32,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 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:56:32,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 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:56:32,350 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 0 states have call successors, (0), 0 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:56:32,351 INFO L175 Difference]: Start difference. First operand has 50 places, 26 transitions, 154 flow. Second operand 5 states and 582 transitions. [2023-09-01 09:56:32,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 398 flow [2023-09-01 09:56:32,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 319 flow, removed 18 selfloop flow, removed 9 redundant places. [2023-09-01 09:56:32,353 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 118 flow [2023-09-01 09:56:32,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2023-09-01 09:56:32,354 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2023-09-01 09:56:32,354 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 25 transitions, 118 flow [2023-09-01 09:56:32,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 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:56:32,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:56:32,355 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:56:32,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:56:32,355 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:56:32,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:56:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1643992453, now seen corresponding path program 2 times [2023-09-01 09:56:32,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:56:32,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999733227] [2023-09-01 09:56:32,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:56:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:56:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:56:32,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:56:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:56:32,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:56:32,465 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:56:32,466 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-09-01 09:56:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-09-01 09:56:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-09-01 09:56:32,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-09-01 09:56:32,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:56:32,468 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 09:56:32,471 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:56:32,471 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:56:32,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:56:32 BasicIcfg [2023-09-01 09:56:32,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:56:32,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:56:32,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:56:32,528 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:56:32,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:56:22" (3/4) ... [2023-09-01 09:56:32,529 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:56:32,603 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:56:32,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:56:32,604 INFO L158 Benchmark]: Toolchain (without parser) took 11643.63ms. Allocated memory was 65.0MB in the beginning and 341.8MB in the end (delta: 276.8MB). Free memory was 40.4MB in the beginning and 162.9MB in the end (delta: -122.4MB). Peak memory consumption was 154.7MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,604 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:56:32,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 571.87ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 51.7MB in the end (delta: -11.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.49ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 49.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,604 INFO L158 Benchmark]: Boogie Preprocessor took 49.52ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 47.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,605 INFO L158 Benchmark]: RCFGBuilder took 732.52ms. Allocated memory is still 83.9MB. Free memory was 47.2MB in the beginning and 56.7MB in the end (delta: -9.5MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,605 INFO L158 Benchmark]: TraceAbstraction took 10119.89ms. Allocated memory was 83.9MB in the beginning and 341.8MB in the end (delta: 257.9MB). Free memory was 56.2MB in the beginning and 175.4MB in the end (delta: -119.2MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,605 INFO L158 Benchmark]: Witness Printer took 75.73ms. Allocated memory is still 341.8MB. Free memory was 175.4MB in the beginning and 162.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-09-01 09:56:32,606 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.17ms. Allocated memory is still 65.0MB. Free memory was 42.7MB in the beginning and 42.6MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 571.87ms. Allocated memory was 65.0MB in the beginning and 83.9MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 51.7MB in the end (delta: -11.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.49ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 49.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.52ms. Allocated memory is still 83.9MB. Free memory was 49.3MB in the beginning and 47.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 732.52ms. Allocated memory is still 83.9MB. Free memory was 47.2MB in the beginning and 56.7MB in the end (delta: -9.5MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10119.89ms. Allocated memory was 83.9MB in the beginning and 341.8MB in the end (delta: 257.9MB). Free memory was 56.2MB in the beginning and 175.4MB in the end (delta: -119.2MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. * Witness Printer took 75.73ms. Allocated memory is still 341.8MB. Free memory was 175.4MB in the beginning and 162.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 118 PlacesBefore, 29 PlacesAfterwards, 109 TransitionsBefore, 19 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 8 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 3106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1242, independent: 1071, independent conditional: 0, independent unconditional: 1071, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 591, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1242, independent: 515, independent conditional: 0, independent unconditional: 515, dependent: 136, dependent conditional: 0, dependent unconditional: 136, unknown: 591, unknown conditional: 0, unknown unconditional: 591] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2109, ((void *)0), P0, ((void *)0))=-3, t2109={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] 0 pthread_t t2110; [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((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=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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2110, ((void *)0), P1, ((void *)0))=-2, t2109={7:0}, t2110={5:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 pthread_t t2111; [L791] 2 x = 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 x = 2 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L839] FCALL, FORK 0 pthread_create(&t2111, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2111, ((void *)0), P2, ((void *)0))=-1, t2109={7:0}, t2110={5:0}, t2111={6:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 __unbuffered_p2_EAX = x 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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 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_p0_EBX=0, __unbuffered_p2_EAX=2, 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=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \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_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2109={7:0}, t2110={5:0}, t2111={6:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \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_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 837]: 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: 835]: 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: 839]: 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, 148 locations, 4 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: 10.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 857 IncrementalHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 37 mSDtfsCounter, 857 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=8, InterpolantAutomatonStates: 53, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 155 ConstructedInterpolants, 0 QuantifiedInterpolants, 704 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:56:32,640 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