./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --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:52:27,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:52:27,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:52:27,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:52:27,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:52:27,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:52:27,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:52:27,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:52:27,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:52:27,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:52:27,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:52:27,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:52:27,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:52:27,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:52:27,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:52:27,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:52:27,585 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:52:27,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:52:27,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:52:27,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:52:27,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:52:27,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:52:27,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:52:27,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:52:27,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:52:27,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:52:27,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:52:27,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:52:27,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:52:27,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:52:27,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:52:27,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:52:27,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:52:27,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:52:27,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:52:27,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:52:27,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:52:27,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:52:27,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:52:27,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:52:27,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:52:27,604 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:52:27,630 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:52:27,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:52:27,632 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:52:27,632 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:52:27,633 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:52:27,633 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:52:27,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:52:27,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:52:27,635 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:52:27,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:52:27,636 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:52:27,636 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:52:27,636 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:52:27,636 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:52:27,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:52:27,637 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:52:27,637 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:52:27,637 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:52:27,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:52:27,637 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:52:27,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:52:27,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:52:27,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:52:27,638 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:52:27,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:27,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:52:27,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:52:27,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:52:27,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:52:27,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:52:27,639 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:52:27,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:52:27,640 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:52:27,640 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:52:27,640 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:52:27,640 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 -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 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:52:27,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:52:27,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:52:27,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:52:27,969 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:52:27,970 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:52:27,971 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:52:29,220 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:52:29,500 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:52:29,501 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:52:29,517 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113b7639/4480065b162f467aa2f7cabe78833d6f/FLAGf0262a8aa [2023-09-01 09:52:29,532 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4113b7639/4480065b162f467aa2f7cabe78833d6f [2023-09-01 09:52:29,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:52:29,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:52:29,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:29,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:52:29,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:52:29,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:29" (1/1) ... [2023-09-01 09:52:29,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531e3d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:29, skipping insertion in model container [2023-09-01 09:52:29,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:52:29" (1/1) ... [2023-09-01 09:52:29,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:52:29,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:52:29,708 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-09-01 09:52:29,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:29,944 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:52:29,954 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-09-01 09:52:30,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:52:30,085 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:30,085 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:52:30,091 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:52:30,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30 WrapperNode [2023-09-01 09:52:30,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:52:30,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:30,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:52:30,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:52:30,111 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:52:30" (1/1) ... [2023-09-01 09:52:30,140 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:52:30" (1/1) ... [2023-09-01 09:52:30,173 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-09-01 09:52:30,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:52:30,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:52:30,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:52:30,175 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:52:30,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:52:30,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:52:30,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:52:30,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:52:30,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (1/1) ... [2023-09-01 09:52:30,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:52:30,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:52:30,262 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:52:30,280 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:52:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:52:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:52:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:52:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:52:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:52:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:52:30,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:52:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:52:30,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:52:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:52:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:52:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:52:30,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:52:30,309 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:52:30,502 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:52:30,504 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:52:30,716 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:52:30,917 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:52:30,917 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:52:30,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:30 BoogieIcfgContainer [2023-09-01 09:52:30,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:52:30,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:52:30,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:52:30,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:52:30,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:52:29" (1/3) ... [2023-09-01 09:52:30,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4645fead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:30, skipping insertion in model container [2023-09-01 09:52:30,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:52:30" (2/3) ... [2023-09-01 09:52:30,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4645fead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:52:30, skipping insertion in model container [2023-09-01 09:52:30,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:30" (3/3) ... [2023-09-01 09:52:30,928 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-09-01 09:52:30,935 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:52:30,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:52:30,944 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:52:30,944 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:52:31,001 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:52:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2023-09-01 09:52:31,074 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-09-01 09:52:31,080 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:31,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-01 09:52:31,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2023-09-01 09:52:31,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2023-09-01 09:52:31,100 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:52:31,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2023-09-01 09:52:31,127 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2023-09-01 09:52:31,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2023-09-01 09:52:31,146 INFO L130 PetriNetUnfolder]: 2/85 cut-off events. [2023-09-01 09:52:31,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:31,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-09-01 09:52:31,148 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-09-01 09:52:34,076 INFO L134 LiptonReduction]: Checked pairs total: 2481 [2023-09-01 09:52:34,076 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-09-01 09:52:34,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:52:34,094 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;@49fd0300, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:52:34,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:52:34,097 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-09-01 09:52:34,097 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:52:34,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:34,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:52:34,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:34,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash 380399145, now seen corresponding path program 1 times [2023-09-01 09:52:34,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:34,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419194952] [2023-09-01 09:52:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:34,412 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:52:34,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:34,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419194952] [2023-09-01 09:52:34,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419194952] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:34,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:34,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:52:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101392311] [2023-09-01 09:52:34,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:34,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:34,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:34,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 163 [2023-09-01 09:52:34,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:52:34,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:34,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 163 [2023-09-01 09:52:34,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:34,587 INFO L130 PetriNetUnfolder]: 159/309 cut-off events. [2023-09-01 09:52:34,588 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-09-01 09:52:34,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 309 events. 159/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1350 event pairs, 24 based on Foata normal form. 16/292 useless extension candidates. Maximal degree in co-relation 593. Up to 220 conditions per place. [2023-09-01 09:52:34,593 INFO L137 encePairwiseOnDemand]: 159/163 looper letters, 19 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2023-09-01 09:52:34,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 110 flow [2023-09-01 09:52:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-09-01 09:52:34,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173824130879345 [2023-09-01 09:52:34,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-09-01 09:52:34,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-09-01 09:52:34,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:34,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-09-01 09:52:34,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 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:52:34,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:52:34,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:52:34,625 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 253 transitions. [2023-09-01 09:52:34,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 27 transitions, 110 flow [2023-09-01 09:52:34,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:34,629 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-09-01 09:52:34,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-09-01 09:52:34,634 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-09-01 09:52:34,635 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-09-01 09:52:34,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 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:52:34,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:34,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:34,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:52:34,637 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:34,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1946213016, now seen corresponding path program 1 times [2023-09-01 09:52:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:34,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914169331] [2023-09-01 09:52:34,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:35,354 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:52:35,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:35,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914169331] [2023-09-01 09:52:35,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914169331] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:35,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:35,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:35,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398018971] [2023-09-01 09:52:35,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:35,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:52:35,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:35,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:52:35,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:52:35,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 163 [2023-09-01 09:52:35,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:35,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:35,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 163 [2023-09-01 09:52:35,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:35,549 INFO L130 PetriNetUnfolder]: 149/293 cut-off events. [2023-09-01 09:52:35,549 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-09-01 09:52:35,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 293 events. 149/293 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1173 event pairs, 70 based on Foata normal form. 20/313 useless extension candidates. Maximal degree in co-relation 601. Up to 229 conditions per place. [2023-09-01 09:52:35,554 INFO L137 encePairwiseOnDemand]: 158/163 looper letters, 19 selfloop transitions, 3 changer transitions 11/34 dead transitions. [2023-09-01 09:52:35,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 150 flow [2023-09-01 09:52:35,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:52:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:52:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 385 transitions. [2023-09-01 09:52:35,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723926380368098 [2023-09-01 09:52:35,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 385 transitions. [2023-09-01 09:52:35,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 385 transitions. [2023-09-01 09:52:35,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:35,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 385 transitions. [2023-09-01 09:52:35,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 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:52:35,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 0 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:52:35,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 0 states have call successors, (0), 0 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:52:35,565 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 5 states and 385 transitions. [2023-09-01 09:52:35,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 150 flow [2023-09-01 09:52:35,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 34 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:35,567 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 63 flow [2023-09-01 09:52:35,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-09-01 09:52:35,568 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-09-01 09:52:35,568 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 63 flow [2023-09-01 09:52:35,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 5 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:35,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:35,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:35,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:52:35,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:35,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash -203087346, now seen corresponding path program 1 times [2023-09-01 09:52:35,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:35,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188162609] [2023-09-01 09:52:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:35,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:36,323 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:52:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188162609] [2023-09-01 09:52:36,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188162609] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:36,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647588683] [2023-09-01 09:52:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:36,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:36,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:36,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 163 [2023-09-01 09:52:36,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 63 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:52:36,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:36,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 163 [2023-09-01 09:52:36,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:36,497 INFO L130 PetriNetUnfolder]: 137/270 cut-off events. [2023-09-01 09:52:36,497 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-09-01 09:52:36,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 270 events. 137/270 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1037 event pairs, 63 based on Foata normal form. 15/285 useless extension candidates. Maximal degree in co-relation 665. Up to 204 conditions per place. [2023-09-01 09:52:36,500 INFO L137 encePairwiseOnDemand]: 157/163 looper letters, 22 selfloop transitions, 5 changer transitions 10/38 dead transitions. [2023-09-01 09:52:36,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 193 flow [2023-09-01 09:52:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 447 transitions. [2023-09-01 09:52:36,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4570552147239264 [2023-09-01 09:52:36,502 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 447 transitions. [2023-09-01 09:52:36,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 447 transitions. [2023-09-01 09:52:36,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:36,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 447 transitions. [2023-09-01 09:52:36,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:36,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:52:36,506 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:52:36,506 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 63 flow. Second operand 6 states and 447 transitions. [2023-09-01 09:52:36,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 193 flow [2023-09-01 09:52:36,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 38 transitions, 188 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:36,510 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 93 flow [2023-09-01 09:52:36,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2023-09-01 09:52:36,511 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-09-01 09:52:36,514 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 93 flow [2023-09-01 09:52:36,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 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:52:36,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:36,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:36,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:52:36,515 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:36,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -899221783, now seen corresponding path program 1 times [2023-09-01 09:52:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563590149] [2023-09-01 09:52:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:36,917 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:52:36,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:36,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563590149] [2023-09-01 09:52:36,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563590149] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:36,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:36,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:52:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195081041] [2023-09-01 09:52:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:36,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:52:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:52:36,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:52:36,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 163 [2023-09-01 09:52:36,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:52:36,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:36,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 163 [2023-09-01 09:52:36,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:37,279 INFO L130 PetriNetUnfolder]: 134/249 cut-off events. [2023-09-01 09:52:37,279 INFO L131 PetriNetUnfolder]: For 238/238 co-relation queries the response was YES. [2023-09-01 09:52:37,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732 conditions, 249 events. 134/249 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 793 event pairs, 58 based on Foata normal form. 9/258 useless extension candidates. Maximal degree in co-relation 716. Up to 219 conditions per place. [2023-09-01 09:52:37,282 INFO L137 encePairwiseOnDemand]: 157/163 looper letters, 23 selfloop transitions, 5 changer transitions 5/33 dead transitions. [2023-09-01 09:52:37,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 203 flow [2023-09-01 09:52:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:52:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:52:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 387 transitions. [2023-09-01 09:52:37,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39570552147239263 [2023-09-01 09:52:37,284 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 387 transitions. [2023-09-01 09:52:37,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 387 transitions. [2023-09-01 09:52:37,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:37,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 387 transitions. [2023-09-01 09:52:37,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 64.5) internal successors, (387), 6 states have internal predecessors, (387), 0 states have call successors, (0), 0 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:52:37,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:52:37,292 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:52:37,292 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 93 flow. Second operand 6 states and 387 transitions. [2023-09-01 09:52:37,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 203 flow [2023-09-01 09:52:37,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 184 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:37,296 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 110 flow [2023-09-01 09:52:37,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2023-09-01 09:52:37,298 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-09-01 09:52:37,298 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 110 flow [2023-09-01 09:52:37,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:52:37,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:37,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:37,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:52:37,299 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:37,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash 831694033, now seen corresponding path program 1 times [2023-09-01 09:52:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:37,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59597018] [2023-09-01 09:52:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:37,974 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:52:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59597018] [2023-09-01 09:52:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59597018] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:52:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188637266] [2023-09-01 09:52:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:37,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:52:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:52:37,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:52:38,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 163 [2023-09-01 09:52:38,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 110 flow. Second operand has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:52:38,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:38,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 163 [2023-09-01 09:52:38,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:38,153 INFO L130 PetriNetUnfolder]: 111/217 cut-off events. [2023-09-01 09:52:38,153 INFO L131 PetriNetUnfolder]: For 382/382 co-relation queries the response was YES. [2023-09-01 09:52:38,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 217 events. 111/217 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 772 event pairs, 42 based on Foata normal form. 9/222 useless extension candidates. Maximal degree in co-relation 687. Up to 171 conditions per place. [2023-09-01 09:52:38,155 INFO L137 encePairwiseOnDemand]: 156/163 looper letters, 23 selfloop transitions, 9 changer transitions 7/40 dead transitions. [2023-09-01 09:52:38,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 255 flow [2023-09-01 09:52:38,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:52:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:52:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 513 transitions. [2023-09-01 09:52:38,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44960560911481157 [2023-09-01 09:52:38,157 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 513 transitions. [2023-09-01 09:52:38,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 513 transitions. [2023-09-01 09:52:38,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:38,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 513 transitions. [2023-09-01 09:52:38,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 73.28571428571429) internal successors, (513), 7 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:52:38,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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:52:38,161 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 0 states have call successors, (0), 0 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:52:38,161 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 110 flow. Second operand 7 states and 513 transitions. [2023-09-01 09:52:38,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 255 flow [2023-09-01 09:52:38,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 40 transitions, 240 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:38,164 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 145 flow [2023-09-01 09:52:38,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-09-01 09:52:38,165 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-09-01 09:52:38,165 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 145 flow [2023-09-01 09:52:38,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:52:38,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:38,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:38,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:52:38,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:38,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1064961085, now seen corresponding path program 2 times [2023-09-01 09:52:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012841076] [2023-09-01 09:52:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:38,632 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:52:38,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:38,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012841076] [2023-09-01 09:52:38,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012841076] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:38,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:38,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:52:38,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820306460] [2023-09-01 09:52:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:38,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:52:38,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:38,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:52:38,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:52:38,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 163 [2023-09-01 09:52:38,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 145 flow. Second operand has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:52:38,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:38,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 163 [2023-09-01 09:52:38,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:38,844 INFO L130 PetriNetUnfolder]: 121/237 cut-off events. [2023-09-01 09:52:38,844 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2023-09-01 09:52:38,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 237 events. 121/237 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 851 event pairs, 34 based on Foata normal form. 11/245 useless extension candidates. Maximal degree in co-relation 798. Up to 150 conditions per place. [2023-09-01 09:52:38,846 INFO L137 encePairwiseOnDemand]: 156/163 looper letters, 25 selfloop transitions, 12 changer transitions 8/46 dead transitions. [2023-09-01 09:52:38,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 327 flow [2023-09-01 09:52:38,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:52:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:52:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 586 transitions. [2023-09-01 09:52:38,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4493865030674847 [2023-09-01 09:52:38,862 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 586 transitions. [2023-09-01 09:52:38,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 586 transitions. [2023-09-01 09:52:38,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:38,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 586 transitions. [2023-09-01 09:52:38,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 73.25) internal successors, (586), 8 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:52:38,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:52:38,866 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:52:38,867 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 145 flow. Second operand 8 states and 586 transitions. [2023-09-01 09:52:38,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 327 flow [2023-09-01 09:52:38,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 305 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-09-01 09:52:38,871 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 191 flow [2023-09-01 09:52:38,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=191, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2023-09-01 09:52:38,874 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2023-09-01 09:52:38,874 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 191 flow [2023-09-01 09:52:38,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.57142857142857) internal successors, (487), 7 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:52:38,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:38,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:38,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:52:38,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:38,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:38,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1933594913, now seen corresponding path program 1 times [2023-09-01 09:52:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392942451] [2023-09-01 09:52:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:39,062 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:52:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392942451] [2023-09-01 09:52:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392942451] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:39,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:39,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:52:39,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498111291] [2023-09-01 09:52:39,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:39,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:52:39,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:39,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:52:39,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:52:39,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 163 [2023-09-01 09:52:39,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:52:39,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:39,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 163 [2023-09-01 09:52:39,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:39,112 INFO L130 PetriNetUnfolder]: 46/115 cut-off events. [2023-09-01 09:52:39,113 INFO L131 PetriNetUnfolder]: For 346/351 co-relation queries the response was YES. [2023-09-01 09:52:39,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 115 events. 46/115 cut-off events. For 346/351 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 357 event pairs, 17 based on Foata normal form. 10/124 useless extension candidates. Maximal degree in co-relation 438. Up to 76 conditions per place. [2023-09-01 09:52:39,114 INFO L137 encePairwiseOnDemand]: 159/163 looper letters, 28 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-09-01 09:52:39,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 296 flow [2023-09-01 09:52:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:52:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:52:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2023-09-01 09:52:39,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4948875255623722 [2023-09-01 09:52:39,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 242 transitions. [2023-09-01 09:52:39,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 242 transitions. [2023-09-01 09:52:39,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:39,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 242 transitions. [2023-09-01 09:52:39,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 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:52:39,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:52:39,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:52:39,118 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 191 flow. Second operand 3 states and 242 transitions. [2023-09-01 09:52:39,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 296 flow [2023-09-01 09:52:39,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 267 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:39,121 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 190 flow [2023-09-01 09:52:39,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-09-01 09:52:39,122 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-09-01 09:52:39,122 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 190 flow [2023-09-01 09:52:39,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 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:52:39,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:39,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:39,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:52:39,123 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:39,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:39,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1771465290, now seen corresponding path program 1 times [2023-09-01 09:52:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:39,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70129065] [2023-09-01 09:52:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:39,289 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:52:39,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:39,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70129065] [2023-09-01 09:52:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70129065] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:39,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:39,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:52:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582129542] [2023-09-01 09:52:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:39,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:52:39,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:39,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:52:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:52:39,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 163 [2023-09-01 09:52:39,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:52:39,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:39,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 163 [2023-09-01 09:52:39,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:39,340 INFO L130 PetriNetUnfolder]: 19/59 cut-off events. [2023-09-01 09:52:39,340 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2023-09-01 09:52:39,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 59 events. 19/59 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 146 event pairs, 6 based on Foata normal form. 7/65 useless extension candidates. Maximal degree in co-relation 218. Up to 29 conditions per place. [2023-09-01 09:52:39,341 INFO L137 encePairwiseOnDemand]: 159/163 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-09-01 09:52:39,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 285 flow [2023-09-01 09:52:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:52:39,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:52:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2023-09-01 09:52:39,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831288343558282 [2023-09-01 09:52:39,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 315 transitions. [2023-09-01 09:52:39,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 315 transitions. [2023-09-01 09:52:39,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:39,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 315 transitions. [2023-09-01 09:52:39,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 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:52:39,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 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:52:39,345 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 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:52:39,345 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 190 flow. Second operand 4 states and 315 transitions. [2023-09-01 09:52:39,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 285 flow [2023-09-01 09:52:39,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 249 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-09-01 09:52:39,347 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 179 flow [2023-09-01 09:52:39,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-09-01 09:52:39,348 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-09-01 09:52:39,348 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 179 flow [2023-09-01 09:52:39,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 4 states have internal predecessors, (303), 0 states have call successors, (0), 0 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:52:39,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:39,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:39,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:52:39,349 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:39,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:39,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1524379963, now seen corresponding path program 1 times [2023-09-01 09:52:39,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:39,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199722588] [2023-09-01 09:52:39,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:39,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:52:39,791 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:52:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:52:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199722588] [2023-09-01 09:52:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199722588] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:52:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:52:39,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 09:52:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373671658] [2023-09-01 09:52:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:52:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 09:52:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:52:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 09:52:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-09-01 09:52:39,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2023-09-01 09:52:39,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 63.77777777777778) internal successors, (574), 9 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:52:39,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:52:39,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2023-09-01 09:52:39,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:52:40,103 INFO L130 PetriNetUnfolder]: 33/94 cut-off events. [2023-09-01 09:52:40,103 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2023-09-01 09:52:40,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 94 events. 33/94 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 268 event pairs, 2 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 355. Up to 36 conditions per place. [2023-09-01 09:52:40,104 INFO L137 encePairwiseOnDemand]: 156/163 looper letters, 21 selfloop transitions, 3 changer transitions 30/54 dead transitions. [2023-09-01 09:52:40,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 420 flow [2023-09-01 09:52:40,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:52:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:52:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 534 transitions. [2023-09-01 09:52:40,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40950920245398775 [2023-09-01 09:52:40,106 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 534 transitions. [2023-09-01 09:52:40,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 534 transitions. [2023-09-01 09:52:40,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:52:40,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 534 transitions. [2023-09-01 09:52:40,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 66.75) internal successors, (534), 8 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:52:40,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:52:40,110 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 0 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:52:40,111 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 179 flow. Second operand 8 states and 534 transitions. [2023-09-01 09:52:40,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 420 flow [2023-09-01 09:52:40,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 392 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-09-01 09:52:40,113 INFO L231 Difference]: Finished difference. Result has 49 places, 22 transitions, 121 flow [2023-09-01 09:52:40,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=121, PETRI_PLACES=49, PETRI_TRANSITIONS=22} [2023-09-01 09:52:40,114 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2023-09-01 09:52:40,114 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 22 transitions, 121 flow [2023-09-01 09:52:40,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.77777777777778) internal successors, (574), 9 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:52:40,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:52:40,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:40,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:52:40,116 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:52:40,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:52:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1577811681, now seen corresponding path program 2 times [2023-09-01 09:52:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:52:40,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423282689] [2023-09-01 09:52:40,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:52:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:52:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:40,161 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:52:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:52:40,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:52:40,225 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:52:40,226 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:52:40,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-09-01 09:52:40,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:52:40,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:52:40,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-09-01 09:52:40,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:52:40,232 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2023-09-01 09:52:40,237 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:52:40,238 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:52:40,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:52:40 BasicIcfg [2023-09-01 09:52:40,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:52:40,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:52:40,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:52:40,302 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:52:40,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:52:30" (3/4) ... [2023-09-01 09:52:40,304 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:52:40,377 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:52:40,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:52:40,378 INFO L158 Benchmark]: Toolchain (without parser) took 10843.10ms. Allocated memory was 71.3MB in the beginning and 199.2MB in the end (delta: 127.9MB). Free memory was 47.2MB in the beginning and 128.8MB in the end (delta: -81.5MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,378 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:52:40,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.46ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.0MB in the beginning and 65.8MB in the end (delta: -18.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.43ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 62.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,379 INFO L158 Benchmark]: Boogie Preprocessor took 54.93ms. Allocated memory is still 90.2MB. Free memory was 62.7MB in the beginning and 61.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,379 INFO L158 Benchmark]: RCFGBuilder took 689.48ms. Allocated memory is still 90.2MB. Free memory was 61.0MB in the beginning and 64.0MB in the end (delta: -2.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,380 INFO L158 Benchmark]: TraceAbstraction took 9378.64ms. Allocated memory was 90.2MB in the beginning and 199.2MB in the end (delta: 109.1MB). Free memory was 63.4MB in the beginning and 136.1MB in the end (delta: -72.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,380 INFO L158 Benchmark]: Witness Printer took 76.06ms. Allocated memory is still 199.2MB. Free memory was 136.1MB in the beginning and 128.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-09-01 09:52:40,381 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.22ms. Allocated memory is still 71.3MB. Free memory was 48.7MB in the beginning and 48.7MB in the end (delta: 48.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.46ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.0MB in the beginning and 65.8MB in the end (delta: -18.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.43ms. Allocated memory is still 90.2MB. Free memory was 65.3MB in the beginning and 62.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.93ms. Allocated memory is still 90.2MB. Free memory was 62.7MB in the beginning and 61.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 689.48ms. Allocated memory is still 90.2MB. Free memory was 61.0MB in the beginning and 64.0MB in the end (delta: -2.9MB). Peak memory consumption was 34.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9378.64ms. Allocated memory was 90.2MB in the beginning and 199.2MB in the end (delta: 109.1MB). Free memory was 63.4MB in the beginning and 136.1MB in the end (delta: -72.7MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 76.06ms. Allocated memory is still 199.2MB. Free memory was 136.1MB in the beginning and 128.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 90 PlacesBefore, 26 PlacesAfterwards, 85 TransitionsBefore, 20 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1053, independent: 933, independent conditional: 0, independent unconditional: 933, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 556, independent: 535, independent conditional: 0, independent unconditional: 535, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1053, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 556, unknown conditional: 0, unknown unconditional: 556] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 105 locations, 5 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: 9.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 941 IncrementalHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 65 mSDtfsCounter, 941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=6, InterpolantAutomatonStates: 50, 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, 3.7s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:52:40,402 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