./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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/mix037_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 16:50:16,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 16:50:16,340 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 16:50:16,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 16:50:16,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 16:50:16,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 16:50:16,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 16:50:16,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 16:50:16,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 16:50:16,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 16:50:16,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 16:50:16,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 16:50:16,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 16:50:16,401 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 16:50:16,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 16:50:16,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 16:50:16,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 16:50:16,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 16:50:16,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 16:50:16,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 16:50:16,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 16:50:16,421 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 16:50:16,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 16:50:16,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 16:50:16,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 16:50:16,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 16:50:16,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 16:50:16,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 16:50:16,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 16:50:16,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 16:50:16,436 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 16:50:16,437 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 16:50:16,439 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 16:50:16,440 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 16:50:16,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 16:50:16,441 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 16:50:16,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 16:50:16,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 16:50:16,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 16:50:16,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 16:50:16,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 16:50:16,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 16:50:16,478 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 16:50:16,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 16:50:16,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 16:50:16,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 16:50:16,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 16:50:16,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 16:50:16,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 16:50:16,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 16:50:16,482 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 16:50:16,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 16:50:16,483 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 16:50:16,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 16:50:16,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 16:50:16,484 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 16:50:16,484 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 16:50:16,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 16:50:16,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 16:50:16,484 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 16:50:16,485 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 16:50:16,485 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 16:50:16,485 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 16:50:16,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 16:50:16,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 16:50:16,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 16:50:16,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:16,486 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 16:50:16,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 16:50:16,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 16:50:16,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 16:50:16,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 16:50:16,488 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 16:50:16,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 16:50:16,488 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 16:50:16,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 16:50:16,489 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 16:50:16,489 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 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 -> AFTER [2023-08-30 16:50:16,805 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 16:50:16,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 16:50:16,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 16:50:16,831 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 16:50:16,831 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 16:50:16,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-08-30 16:50:18,146 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 16:50:18,404 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 16:50:18,405 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2023-08-30 16:50:18,416 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5802f9f56/57544100d35c4a4cbc2dded8807d527b/FLAG84e86de3d [2023-08-30 16:50:18,432 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5802f9f56/57544100d35c4a4cbc2dded8807d527b [2023-08-30 16:50:18,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 16:50:18,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 16:50:18,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:18,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 16:50:18,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 16:50:18,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:18,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea9569a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18, skipping insertion in model container [2023-08-30 16:50:18,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:18,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 16:50:18,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 16:50:18,618 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/mix037_tso.oepc.i[949,962] [2023-08-30 16:50:18,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:18,846 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 16:50:18,858 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/mix037_tso.oepc.i[949,962] [2023-08-30 16:50:18,895 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 16:50:18,926 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:18,926 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 16:50:18,932 INFO L208 MainTranslator]: Completed translation [2023-08-30 16:50:18,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18 WrapperNode [2023-08-30 16:50:18,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 16:50:18,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:18,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 16:50:18,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 16:50:18,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:18,970 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,013 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-30 16:50:19,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 16:50:19,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 16:50:19,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 16:50:19,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 16:50:19,023 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 16:50:19,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 16:50:19,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 16:50:19,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 16:50:19,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (1/1) ... [2023-08-30 16:50:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 16:50:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 16:50:19,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 16:50:19,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 16:50:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 16:50:19,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 16:50:19,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 16:50:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 16:50:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 16:50:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 16:50:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 16:50:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 16:50:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 16:50:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 16:50:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 16:50:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-30 16:50:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-30 16:50:19,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 16:50:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 16:50:19,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 16:50:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 16:50:19,152 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 16:50:19,336 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 16:50:19,338 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 16:50:19,678 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 16:50:19,785 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 16:50:19,785 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 16:50:19,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:19 BoogieIcfgContainer [2023-08-30 16:50:19,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 16:50:19,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 16:50:19,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 16:50:19,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 16:50:19,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:50:18" (1/3) ... [2023-08-30 16:50:19,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22baf0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:19, skipping insertion in model container [2023-08-30 16:50:19,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:50:18" (2/3) ... [2023-08-30 16:50:19,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22baf0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:50:19, skipping insertion in model container [2023-08-30 16:50:19,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:19" (3/3) ... [2023-08-30 16:50:19,803 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-08-30 16:50:19,811 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 16:50:19,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 16:50:19,820 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-30 16:50:19,820 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 16:50:19,863 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 16:50:19,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 16:50:19,937 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 16:50:19,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:19,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:50:19,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2023-08-30 16:50:19,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2023-08-30 16:50:19,950 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 16:50:19,958 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 16:50:19,960 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 270 flow [2023-08-30 16:50:19,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 270 flow [2023-08-30 16:50:19,992 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2023-08-30 16:50:19,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:19,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-30 16:50:19,995 INFO L119 LiptonReduction]: Number of co-enabled transitions 3256 [2023-08-30 16:50:24,748 INFO L134 LiptonReduction]: Checked pairs total: 9118 [2023-08-30 16:50:24,748 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-30 16:50:24,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 16:50:24,766 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;@494334f9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 16:50:24,766 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-30 16:50:24,770 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-08-30 16:50:24,770 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 16:50:24,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:24,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 16:50:24,771 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:24,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:24,775 INFO L85 PathProgramCache]: Analyzing trace with hash 534773525, now seen corresponding path program 1 times [2023-08-30 16:50:24,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:24,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179417235] [2023-08-30 16:50:24,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:25,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179417235] [2023-08-30 16:50:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179417235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:25,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:25,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 16:50:25,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889658320] [2023-08-30 16:50:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:25,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 16:50:25,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:25,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 16:50:25,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 16:50:25,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 244 [2023-08-30 16:50:25,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:25,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:25,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 244 [2023-08-30 16:50:25,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:26,262 INFO L130 PetriNetUnfolder]: 4903/6849 cut-off events. [2023-08-30 16:50:26,263 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2023-08-30 16:50:26,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13697 conditions, 6849 events. 4903/6849 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 34568 event pairs, 1733 based on Foata normal form. 0/6504 useless extension candidates. Maximal degree in co-relation 13685. Up to 5323 conditions per place. [2023-08-30 16:50:26,304 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 39 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-30 16:50:26,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 198 flow [2023-08-30 16:50:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-08-30 16:50:26,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396174863387978 [2023-08-30 16:50:26,322 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-08-30 16:50:26,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-08-30 16:50:26,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:26,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-08-30 16:50:26,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:26,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:26,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:26,339 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 395 transitions. [2023-08-30 16:50:26,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 198 flow [2023-08-30 16:50:26,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:26,345 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-30 16:50:26,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:50:26,350 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:50:26,352 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-30 16:50:26,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:26,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:26,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:26,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 16:50:26,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:26,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1622796010, now seen corresponding path program 1 times [2023-08-30 16:50:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:26,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833086766] [2023-08-30 16:50:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:27,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833086766] [2023-08-30 16:50:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833086766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:27,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:27,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892173222] [2023-08-30 16:50:27,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:27,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:27,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-08-30 16:50:27,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:27,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:27,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-08-30 16:50:27,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:28,137 INFO L130 PetriNetUnfolder]: 6909/9359 cut-off events. [2023-08-30 16:50:28,137 INFO L131 PetriNetUnfolder]: For 485/485 co-relation queries the response was YES. [2023-08-30 16:50:28,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 9359 events. 6909/9359 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 43382 event pairs, 2349 based on Foata normal form. 200/9558 useless extension candidates. Maximal degree in co-relation 19449. Up to 6461 conditions per place. [2023-08-30 16:50:28,195 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-30 16:50:28,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 176 flow [2023-08-30 16:50:28,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-30 16:50:28,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49043715846994534 [2023-08-30 16:50:28,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-30 16:50:28,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-30 16:50:28,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:28,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-30 16:50:28,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:28,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:28,203 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:28,203 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 359 transitions. [2023-08-30 16:50:28,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 176 flow [2023-08-30 16:50:28,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:28,206 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2023-08-30 16:50:28,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-30 16:50:28,206 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-30 16:50:28,207 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 72 flow [2023-08-30 16:50:28,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:28,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:28,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:28,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 16:50:28,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:28,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:28,209 INFO L85 PathProgramCache]: Analyzing trace with hash 361637534, now seen corresponding path program 1 times [2023-08-30 16:50:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:28,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109158364] [2023-08-30 16:50:28,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:28,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:28,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109158364] [2023-08-30 16:50:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109158364] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:28,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:28,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 16:50:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524771969] [2023-08-30 16:50:28,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:28,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:28,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 244 [2023-08-30 16:50:28,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:28,864 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:28,864 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 244 [2023-08-30 16:50:28,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:29,564 INFO L130 PetriNetUnfolder]: 4455/6234 cut-off events. [2023-08-30 16:50:29,565 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2023-08-30 16:50:29,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13269 conditions, 6234 events. 4455/6234 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30068 event pairs, 1921 based on Foata normal form. 4/6226 useless extension candidates. Maximal degree in co-relation 13258. Up to 5989 conditions per place. [2023-08-30 16:50:29,604 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 36 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-08-30 16:50:29,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 195 flow [2023-08-30 16:50:29,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 16:50:29,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 16:50:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-30 16:50:29,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368852459016393 [2023-08-30 16:50:29,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-30 16:50:29,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-30 16:50:29,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:29,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-30 16:50:29,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:29,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:29,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:29,610 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 72 flow. Second operand 3 states and 393 transitions. [2023-08-30 16:50:29,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 195 flow [2023-08-30 16:50:29,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:29,613 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 101 flow [2023-08-30 16:50:29,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-30 16:50:29,614 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-30 16:50:29,617 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 101 flow [2023-08-30 16:50:29,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:29,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:29,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:29,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 16:50:29,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:29,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1675870343, now seen corresponding path program 1 times [2023-08-30 16:50:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859474789] [2023-08-30 16:50:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859474789] [2023-08-30 16:50:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859474789] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:30,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:30,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308306313] [2023-08-30 16:50:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:30,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:30,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:30,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:30,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:30,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 244 [2023-08-30 16:50:30,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:30,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:30,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 244 [2023-08-30 16:50:30,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:31,108 INFO L130 PetriNetUnfolder]: 4647/6590 cut-off events. [2023-08-30 16:50:31,109 INFO L131 PetriNetUnfolder]: For 1315/1386 co-relation queries the response was YES. [2023-08-30 16:50:31,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15434 conditions, 6590 events. 4647/6590 cut-off events. For 1315/1386 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 33090 event pairs, 1911 based on Foata normal form. 74/6652 useless extension candidates. Maximal degree in co-relation 15422. Up to 5537 conditions per place. [2023-08-30 16:50:31,154 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 54 selfloop transitions, 9 changer transitions 0/66 dead transitions. [2023-08-30 16:50:31,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 321 flow [2023-08-30 16:50:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:31,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-30 16:50:31,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5338114754098361 [2023-08-30 16:50:31,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-30 16:50:31,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-30 16:50:31,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:31,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-30 16:50:31,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:31,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:31,161 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:31,162 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 101 flow. Second operand 4 states and 521 transitions. [2023-08-30 16:50:31,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 321 flow [2023-08-30 16:50:31,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:31,164 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 161 flow [2023-08-30 16:50:31,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-30 16:50:31,165 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-30 16:50:31,165 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 161 flow [2023-08-30 16:50:31,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:31,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:31,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:31,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 16:50:31,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:31,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:31,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1633272596, now seen corresponding path program 1 times [2023-08-30 16:50:31,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:31,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225706581] [2023-08-30 16:50:31,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:31,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:31,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:31,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225706581] [2023-08-30 16:50:31,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225706581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:31,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:31,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:31,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154836239] [2023-08-30 16:50:31,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:31,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:31,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:31,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:31,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:31,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-08-30 16:50:31,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:31,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:31,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-08-30 16:50:31,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:32,980 INFO L130 PetriNetUnfolder]: 9532/12849 cut-off events. [2023-08-30 16:50:32,980 INFO L131 PetriNetUnfolder]: For 8457/8457 co-relation queries the response was YES. [2023-08-30 16:50:32,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34717 conditions, 12849 events. 9532/12849 cut-off events. For 8457/8457 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 59136 event pairs, 3771 based on Foata normal form. 20/12869 useless extension candidates. Maximal degree in co-relation 34702. Up to 10813 conditions per place. [2023-08-30 16:50:33,042 INFO L137 encePairwiseOnDemand]: 233/244 looper letters, 64 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2023-08-30 16:50:33,042 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 452 flow [2023-08-30 16:50:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-08-30 16:50:33,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979508196721312 [2023-08-30 16:50:33,045 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-08-30 16:50:33,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-08-30 16:50:33,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:33,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-08-30 16:50:33,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:33,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:33,049 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:33,050 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 161 flow. Second operand 4 states and 486 transitions. [2023-08-30 16:50:33,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 452 flow [2023-08-30 16:50:33,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 446 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-30 16:50:33,062 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 271 flow [2023-08-30 16:50:33,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-30 16:50:33,064 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2023-08-30 16:50:33,065 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 271 flow [2023-08-30 16:50:33,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:33,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:33,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:33,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 16:50:33,066 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:33,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1623647044, now seen corresponding path program 2 times [2023-08-30 16:50:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593213765] [2023-08-30 16:50:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:33,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:33,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:33,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593213765] [2023-08-30 16:50:33,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593213765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:33,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:33,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125773721] [2023-08-30 16:50:33,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:33,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:33,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:33,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:33,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 244 [2023-08-30 16:50:33,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:33,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:33,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 244 [2023-08-30 16:50:33,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:34,325 INFO L130 PetriNetUnfolder]: 6267/8894 cut-off events. [2023-08-30 16:50:34,325 INFO L131 PetriNetUnfolder]: For 11726/11812 co-relation queries the response was YES. [2023-08-30 16:50:34,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28461 conditions, 8894 events. 6267/8894 cut-off events. For 11726/11812 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 46156 event pairs, 2298 based on Foata normal form. 60/8798 useless extension candidates. Maximal degree in co-relation 28442. Up to 6566 conditions per place. [2023-08-30 16:50:34,369 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 67 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-08-30 16:50:34,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 81 transitions, 544 flow [2023-08-30 16:50:34,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:34,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:34,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2023-08-30 16:50:34,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358606557377049 [2023-08-30 16:50:34,371 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2023-08-30 16:50:34,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2023-08-30 16:50:34,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:34,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2023-08-30 16:50:34,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:34,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:34,375 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:34,375 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 271 flow. Second operand 4 states and 523 transitions. [2023-08-30 16:50:34,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 81 transitions, 544 flow [2023-08-30 16:50:34,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 81 transitions, 534 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:34,389 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 286 flow [2023-08-30 16:50:34,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-08-30 16:50:34,390 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-08-30 16:50:34,390 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 286 flow [2023-08-30 16:50:34,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:34,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:34,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:34,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 16:50:34,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:34,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:34,391 INFO L85 PathProgramCache]: Analyzing trace with hash -976250165, now seen corresponding path program 1 times [2023-08-30 16:50:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994184500] [2023-08-30 16:50:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:34,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:34,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:34,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994184500] [2023-08-30 16:50:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994184500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135550040] [2023-08-30 16:50:34,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:34,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:34,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-08-30 16:50:34,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:34,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:34,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-08-30 16:50:34,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:35,765 INFO L130 PetriNetUnfolder]: 6586/9397 cut-off events. [2023-08-30 16:50:35,765 INFO L131 PetriNetUnfolder]: For 15915/16017 co-relation queries the response was YES. [2023-08-30 16:50:35,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30616 conditions, 9397 events. 6586/9397 cut-off events. For 15915/16017 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 49934 event pairs, 2319 based on Foata normal form. 20/9284 useless extension candidates. Maximal degree in co-relation 30595. Up to 6599 conditions per place. [2023-08-30 16:50:35,817 INFO L137 encePairwiseOnDemand]: 235/244 looper letters, 71 selfloop transitions, 22 changer transitions 0/98 dead transitions. [2023-08-30 16:50:35,817 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 663 flow [2023-08-30 16:50:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:35,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-30 16:50:35,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286885245901639 [2023-08-30 16:50:35,819 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-30 16:50:35,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-30 16:50:35,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:35,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-30 16:50:35,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:35,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:35,823 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:35,824 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 286 flow. Second operand 5 states and 645 transitions. [2023-08-30 16:50:35,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 663 flow [2023-08-30 16:50:35,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 643 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 16:50:35,838 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 414 flow [2023-08-30 16:50:35,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=414, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2023-08-30 16:50:35,839 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2023-08-30 16:50:35,840 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 414 flow [2023-08-30 16:50:35,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:35,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:35,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:35,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 16:50:35,841 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:35,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -973686155, now seen corresponding path program 2 times [2023-08-30 16:50:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389859772] [2023-08-30 16:50:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:36,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:36,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389859772] [2023-08-30 16:50:36,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389859772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:36,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462629550] [2023-08-30 16:50:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:36,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:36,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:36,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:36,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-08-30 16:50:36,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 414 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:36,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:36,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-08-30 16:50:36,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:37,981 INFO L130 PetriNetUnfolder]: 10159/13688 cut-off events. [2023-08-30 16:50:37,981 INFO L131 PetriNetUnfolder]: For 31120/31120 co-relation queries the response was YES. [2023-08-30 16:50:38,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49341 conditions, 13688 events. 10159/13688 cut-off events. For 31120/31120 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 65840 event pairs, 1302 based on Foata normal form. 40/13728 useless extension candidates. Maximal degree in co-relation 49318. Up to 10081 conditions per place. [2023-08-30 16:50:38,151 INFO L137 encePairwiseOnDemand]: 235/244 looper letters, 116 selfloop transitions, 47 changer transitions 0/163 dead transitions. [2023-08-30 16:50:38,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 163 transitions, 1259 flow [2023-08-30 16:50:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 16:50:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 16:50:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-08-30 16:50:38,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005122950819673 [2023-08-30 16:50:38,155 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-08-30 16:50:38,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-08-30 16:50:38,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:38,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-08-30 16:50:38,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,162 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,163 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 414 flow. Second operand 8 states and 977 transitions. [2023-08-30 16:50:38,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 163 transitions, 1259 flow [2023-08-30 16:50:38,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 163 transitions, 1206 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:38,242 INFO L231 Difference]: Finished difference. Result has 65 places, 86 transitions, 780 flow [2023-08-30 16:50:38,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=780, PETRI_PLACES=65, PETRI_TRANSITIONS=86} [2023-08-30 16:50:38,243 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-30 16:50:38,243 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 86 transitions, 780 flow [2023-08-30 16:50:38,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:38,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:38,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 16:50:38,244 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:38,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:38,245 INFO L85 PathProgramCache]: Analyzing trace with hash -784427592, now seen corresponding path program 1 times [2023-08-30 16:50:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773042957] [2023-08-30 16:50:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:38,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773042957] [2023-08-30 16:50:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773042957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908368000] [2023-08-30 16:50:38,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:38,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:38,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:38,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 16:50:38,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 86 transitions, 780 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:38,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:38,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 16:50:38,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:39,418 INFO L130 PetriNetUnfolder]: 5769/8348 cut-off events. [2023-08-30 16:50:39,418 INFO L131 PetriNetUnfolder]: For 40910/41698 co-relation queries the response was YES. [2023-08-30 16:50:39,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34523 conditions, 8348 events. 5769/8348 cut-off events. For 40910/41698 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 46708 event pairs, 1164 based on Foata normal form. 981/9109 useless extension candidates. Maximal degree in co-relation 34497. Up to 4741 conditions per place. [2023-08-30 16:50:39,481 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 174 selfloop transitions, 10 changer transitions 14/208 dead transitions. [2023-08-30 16:50:39,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 208 transitions, 2217 flow [2023-08-30 16:50:39,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 16:50:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 16:50:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-30 16:50:39,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057377049180328 [2023-08-30 16:50:39,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-30 16:50:39,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-30 16:50:39,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:39,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-30 16:50:39,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,489 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,489 INFO L175 Difference]: Start difference. First operand has 65 places, 86 transitions, 780 flow. Second operand 5 states and 617 transitions. [2023-08-30 16:50:39,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 208 transitions, 2217 flow [2023-08-30 16:50:39,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 208 transitions, 1955 flow, removed 54 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:39,555 INFO L231 Difference]: Finished difference. Result has 68 places, 88 transitions, 677 flow [2023-08-30 16:50:39,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=68, PETRI_TRANSITIONS=88} [2023-08-30 16:50:39,555 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places. [2023-08-30 16:50:39,556 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 88 transitions, 677 flow [2023-08-30 16:50:39,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:39,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:39,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 16:50:39,557 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:39,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1147622950, now seen corresponding path program 1 times [2023-08-30 16:50:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620029023] [2023-08-30 16:50:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:39,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:39,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620029023] [2023-08-30 16:50:39,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620029023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:39,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:39,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:39,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897203686] [2023-08-30 16:50:39,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:39,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:39,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 16:50:39,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 88 transitions, 677 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:39,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:39,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 16:50:39,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:40,472 INFO L130 PetriNetUnfolder]: 4606/6829 cut-off events. [2023-08-30 16:50:40,473 INFO L131 PetriNetUnfolder]: For 32294/32989 co-relation queries the response was YES. [2023-08-30 16:50:40,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30830 conditions, 6829 events. 4606/6829 cut-off events. For 32294/32989 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 39184 event pairs, 443 based on Foata normal form. 657/7309 useless extension candidates. Maximal degree in co-relation 30802. Up to 2324 conditions per place. [2023-08-30 16:50:40,513 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 206 selfloop transitions, 19 changer transitions 17/252 dead transitions. [2023-08-30 16:50:40,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 252 transitions, 2425 flow [2023-08-30 16:50:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 16:50:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 16:50:40,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 866 transitions. [2023-08-30 16:50:40,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070257611241218 [2023-08-30 16:50:40,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 866 transitions. [2023-08-30 16:50:40,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 866 transitions. [2023-08-30 16:50:40,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:40,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 866 transitions. [2023-08-30 16:50:40,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.71428571428571) internal successors, (866), 7 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,522 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,523 INFO L175 Difference]: Start difference. First operand has 68 places, 88 transitions, 677 flow. Second operand 7 states and 866 transitions. [2023-08-30 16:50:40,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 252 transitions, 2425 flow [2023-08-30 16:50:40,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 252 transitions, 2418 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 16:50:40,571 INFO L231 Difference]: Finished difference. Result has 76 places, 94 transitions, 785 flow [2023-08-30 16:50:40,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=785, PETRI_PLACES=76, PETRI_TRANSITIONS=94} [2023-08-30 16:50:40,572 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-08-30 16:50:40,572 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 94 transitions, 785 flow [2023-08-30 16:50:40,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:40,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:40,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 16:50:40,573 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:40,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:40,573 INFO L85 PathProgramCache]: Analyzing trace with hash -588992852, now seen corresponding path program 1 times [2023-08-30 16:50:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:40,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544567846] [2023-08-30 16:50:40,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:40,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:40,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:40,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544567846] [2023-08-30 16:50:40,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544567846] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:40,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:40,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 16:50:40,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894244482] [2023-08-30 16:50:40,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:40,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 16:50:40,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:40,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 16:50:40,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 16:50:40,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 16:50:40,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 94 transitions, 785 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:40,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:40,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 16:50:40,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:41,553 INFO L130 PetriNetUnfolder]: 4290/6366 cut-off events. [2023-08-30 16:50:41,553 INFO L131 PetriNetUnfolder]: For 33174/33849 co-relation queries the response was YES. [2023-08-30 16:50:41,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31154 conditions, 6366 events. 4290/6366 cut-off events. For 33174/33849 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36435 event pairs, 353 based on Foata normal form. 381/6577 useless extension candidates. Maximal degree in co-relation 31122. Up to 2043 conditions per place. [2023-08-30 16:50:41,589 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 212 selfloop transitions, 28 changer transitions 26/276 dead transitions. [2023-08-30 16:50:41,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 276 transitions, 2740 flow [2023-08-30 16:50:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-30 16:50:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-30 16:50:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1113 transitions. [2023-08-30 16:50:41,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068306010928961 [2023-08-30 16:50:41,593 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1113 transitions. [2023-08-30 16:50:41,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1113 transitions. [2023-08-30 16:50:41,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:41,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1113 transitions. [2023-08-30 16:50:41,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.66666666666667) internal successors, (1113), 9 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:41,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:41,599 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 244.0) internal successors, (2440), 10 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:41,600 INFO L175 Difference]: Start difference. First operand has 76 places, 94 transitions, 785 flow. Second operand 9 states and 1113 transitions. [2023-08-30 16:50:41,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 276 transitions, 2740 flow [2023-08-30 16:50:41,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 276 transitions, 2662 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:41,813 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 868 flow [2023-08-30 16:50:41,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2023-08-30 16:50:41,814 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 39 predicate places. [2023-08-30 16:50:41,814 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 868 flow [2023-08-30 16:50:41,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:41,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:41,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:41,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 16:50:41,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:41,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 346982524, now seen corresponding path program 1 times [2023-08-30 16:50:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856962687] [2023-08-30 16:50:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:42,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:42,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856962687] [2023-08-30 16:50:42,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856962687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:42,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:42,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467813252] [2023-08-30 16:50:42,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:42,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:42,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:42,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:42,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:42,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-08-30 16:50:42,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 868 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:42,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:42,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-08-30 16:50:42,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:43,443 INFO L130 PetriNetUnfolder]: 8590/12461 cut-off events. [2023-08-30 16:50:43,443 INFO L131 PetriNetUnfolder]: For 52706/52835 co-relation queries the response was YES. [2023-08-30 16:50:43,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57547 conditions, 12461 events. 8590/12461 cut-off events. For 52706/52835 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 69504 event pairs, 1501 based on Foata normal form. 142/12594 useless extension candidates. Maximal degree in co-relation 57513. Up to 7142 conditions per place. [2023-08-30 16:50:43,514 INFO L137 encePairwiseOnDemand]: 236/244 looper letters, 168 selfloop transitions, 12 changer transitions 68/253 dead transitions. [2023-08-30 16:50:43,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 253 transitions, 2615 flow [2023-08-30 16:50:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:43,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2023-08-30 16:50:43,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48633879781420764 [2023-08-30 16:50:43,517 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2023-08-30 16:50:43,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2023-08-30 16:50:43,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:43,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2023-08-30 16:50:43,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,522 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:43,522 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 868 flow. Second operand 6 states and 712 transitions. [2023-08-30 16:50:43,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 253 transitions, 2615 flow [2023-08-30 16:50:44,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 253 transitions, 2344 flow, removed 94 selfloop flow, removed 4 redundant places. [2023-08-30 16:50:44,083 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 826 flow [2023-08-30 16:50:44,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2023-08-30 16:50:44,084 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2023-08-30 16:50:44,084 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 826 flow [2023-08-30 16:50:44,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:44,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:44,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:44,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 16:50:44,085 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:44,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1858711788, now seen corresponding path program 2 times [2023-08-30 16:50:44,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:44,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786073637] [2023-08-30 16:50:44,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:44,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:44,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:44,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:44,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786073637] [2023-08-30 16:50:44,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786073637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:44,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:44,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 16:50:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869111707] [2023-08-30 16:50:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 16:50:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 16:50:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-30 16:50:44,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-30 16:50:44,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 826 flow. Second operand has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:44,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:44,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-30 16:50:44,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:45,116 INFO L130 PetriNetUnfolder]: 4511/6808 cut-off events. [2023-08-30 16:50:45,116 INFO L131 PetriNetUnfolder]: For 35851/36500 co-relation queries the response was YES. [2023-08-30 16:50:45,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32053 conditions, 6808 events. 4511/6808 cut-off events. For 35851/36500 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 40878 event pairs, 338 based on Foata normal form. 324/6988 useless extension candidates. Maximal degree in co-relation 32015. Up to 2247 conditions per place. [2023-08-30 16:50:45,150 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 183 selfloop transitions, 27 changer transitions 62/281 dead transitions. [2023-08-30 16:50:45,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 281 transitions, 2815 flow [2023-08-30 16:50:45,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-30 16:50:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-30 16:50:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1326 transitions. [2023-08-30 16:50:45,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940387481371088 [2023-08-30 16:50:45,154 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1326 transitions. [2023-08-30 16:50:45,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1326 transitions. [2023-08-30 16:50:45,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:45,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1326 transitions. [2023-08-30 16:50:45,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.54545454545455) internal successors, (1326), 11 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 244.0) internal successors, (2928), 12 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,162 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 244.0) internal successors, (2928), 12 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,162 INFO L175 Difference]: Start difference. First operand has 86 places, 101 transitions, 826 flow. Second operand 11 states and 1326 transitions. [2023-08-30 16:50:45,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 281 transitions, 2815 flow [2023-08-30 16:50:45,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 281 transitions, 2719 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:45,298 INFO L231 Difference]: Finished difference. Result has 95 places, 93 transitions, 776 flow [2023-08-30 16:50:45,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=776, PETRI_PLACES=95, PETRI_TRANSITIONS=93} [2023-08-30 16:50:45,298 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 52 predicate places. [2023-08-30 16:50:45,299 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 93 transitions, 776 flow [2023-08-30 16:50:45,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.0) internal successors, (784), 7 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:45,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:45,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 16:50:45,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:45,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1103512688, now seen corresponding path program 1 times [2023-08-30 16:50:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:45,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302797866] [2023-08-30 16:50:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:45,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:45,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302797866] [2023-08-30 16:50:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302797866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:45,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 16:50:45,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715318525] [2023-08-30 16:50:45,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:45,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 16:50:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 16:50:45,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-30 16:50:45,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 244 [2023-08-30 16:50:45,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 93 transitions, 776 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:45,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:45,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 244 [2023-08-30 16:50:45,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:46,789 INFO L130 PetriNetUnfolder]: 6356/9452 cut-off events. [2023-08-30 16:50:46,789 INFO L131 PetriNetUnfolder]: For 37393/37451 co-relation queries the response was YES. [2023-08-30 16:50:46,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43045 conditions, 9452 events. 6356/9452 cut-off events. For 37393/37451 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 55515 event pairs, 501 based on Foata normal form. 59/9461 useless extension candidates. Maximal degree in co-relation 43014. Up to 4946 conditions per place. [2023-08-30 16:50:46,822 INFO L137 encePairwiseOnDemand]: 237/244 looper letters, 122 selfloop transitions, 9 changer transitions 71/206 dead transitions. [2023-08-30 16:50:46,822 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 206 transitions, 2089 flow [2023-08-30 16:50:46,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:46,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions. [2023-08-30 16:50:46,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781420765027322 [2023-08-30 16:50:46,825 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 700 transitions. [2023-08-30 16:50:46,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions. [2023-08-30 16:50:46,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:46,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions. [2023-08-30 16:50:46,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,829 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,829 INFO L175 Difference]: Start difference. First operand has 95 places, 93 transitions, 776 flow. Second operand 6 states and 700 transitions. [2023-08-30 16:50:46,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 206 transitions, 2089 flow [2023-08-30 16:50:46,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 206 transitions, 1824 flow, removed 58 selfloop flow, removed 12 redundant places. [2023-08-30 16:50:46,989 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 604 flow [2023-08-30 16:50:46,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=604, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2023-08-30 16:50:46,990 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places. [2023-08-30 16:50:46,990 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 604 flow [2023-08-30 16:50:46,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:46,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:46,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:46,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 16:50:46,991 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:46,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1251624762, now seen corresponding path program 2 times [2023-08-30 16:50:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529653008] [2023-08-30 16:50:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:47,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529653008] [2023-08-30 16:50:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529653008] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 16:50:47,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658368652] [2023-08-30 16:50:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:47,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 16:50:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 16:50:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 16:50:47,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 244 [2023-08-30 16:50:47,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 604 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:47,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:47,241 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 244 [2023-08-30 16:50:47,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:48,242 INFO L130 PetriNetUnfolder]: 6472/9979 cut-off events. [2023-08-30 16:50:48,243 INFO L131 PetriNetUnfolder]: For 40789/40810 co-relation queries the response was YES. [2023-08-30 16:50:48,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46257 conditions, 9979 events. 6472/9979 cut-off events. For 40789/40810 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 64765 event pairs, 1224 based on Foata normal form. 7/9825 useless extension candidates. Maximal degree in co-relation 46221. Up to 4669 conditions per place. [2023-08-30 16:50:48,279 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 59 selfloop transitions, 1 changer transitions 116/180 dead transitions. [2023-08-30 16:50:48,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 180 transitions, 1693 flow [2023-08-30 16:50:48,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 16:50:48,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 16:50:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-30 16:50:48,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184426229508197 [2023-08-30 16:50:48,281 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-30 16:50:48,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-30 16:50:48,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:48,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-30 16:50:48,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,283 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,284 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 604 flow. Second operand 4 states and 506 transitions. [2023-08-30 16:50:48,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 180 transitions, 1693 flow [2023-08-30 16:50:48,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 180 transitions, 1627 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-30 16:50:48,474 INFO L231 Difference]: Finished difference. Result has 89 places, 56 transitions, 371 flow [2023-08-30 16:50:48,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=371, PETRI_PLACES=89, PETRI_TRANSITIONS=56} [2023-08-30 16:50:48,474 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2023-08-30 16:50:48,475 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 56 transitions, 371 flow [2023-08-30 16:50:48,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:48,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:48,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:48,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 16:50:48,476 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:48,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash -311966414, now seen corresponding path program 3 times [2023-08-30 16:50:48,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:48,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37503294] [2023-08-30 16:50:48,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:48,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 16:50:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 16:50:50,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 16:50:50,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37503294] [2023-08-30 16:50:50,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37503294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 16:50:50,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 16:50:50,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 16:50:50,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396656503] [2023-08-30 16:50:50,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 16:50:50,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 16:50:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 16:50:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 16:50:50,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 16:50:50,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-08-30 16:50:50,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 56 transitions, 371 flow. Second operand has 10 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:50,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 16:50:50,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-08-30 16:50:50,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 16:50:51,016 INFO L130 PetriNetUnfolder]: 3152/5061 cut-off events. [2023-08-30 16:50:51,016 INFO L131 PetriNetUnfolder]: For 16667/16795 co-relation queries the response was YES. [2023-08-30 16:50:51,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22121 conditions, 5061 events. 3152/5061 cut-off events. For 16667/16795 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 30074 event pairs, 635 based on Foata normal form. 39/4956 useless extension candidates. Maximal degree in co-relation 22091. Up to 2230 conditions per place. [2023-08-30 16:50:51,035 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 56 selfloop transitions, 4 changer transitions 62/125 dead transitions. [2023-08-30 16:50:51,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 125 transitions, 1027 flow [2023-08-30 16:50:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 16:50:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 16:50:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 724 transitions. [2023-08-30 16:50:51,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49453551912568305 [2023-08-30 16:50:51,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 724 transitions. [2023-08-30 16:50:51,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 724 transitions. [2023-08-30 16:50:51,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 16:50:51,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 724 transitions. [2023-08-30 16:50:51,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.66666666666667) internal successors, (724), 6 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:51,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:51,043 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:51,043 INFO L175 Difference]: Start difference. First operand has 89 places, 56 transitions, 371 flow. Second operand 6 states and 724 transitions. [2023-08-30 16:50:51,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 125 transitions, 1027 flow [2023-08-30 16:50:51,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 125 transitions, 1005 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-08-30 16:50:51,091 INFO L231 Difference]: Finished difference. Result has 81 places, 47 transitions, 303 flow [2023-08-30 16:50:51,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=81, PETRI_TRANSITIONS=47} [2023-08-30 16:50:51,091 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-08-30 16:50:51,092 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 47 transitions, 303 flow [2023-08-30 16:50:51,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 16:50:51,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 16:50:51,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:51,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 16:50:51,093 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-30 16:50:51,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 16:50:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash 135837058, now seen corresponding path program 4 times [2023-08-30 16:50:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 16:50:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581002375] [2023-08-30 16:50:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 16:50:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 16:50:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:51,144 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 16:50:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 16:50:51,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 16:50:51,213 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 16:50:51,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-30 16:50:51,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-30 16:50:51,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-30 16:50:51,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-30 16:50:51,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-30 16:50:51,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-30 16:50:51,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-30 16:50:51,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 16:50:51,217 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 16:50:51,222 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 16:50:51,222 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 16:50:51,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 04:50:51 BasicIcfg [2023-08-30 16:50:51,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 16:50:51,282 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 16:50:51,282 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 16:50:51,282 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 16:50:51,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:50:19" (3/4) ... [2023-08-30 16:50:51,284 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-08-30 16:50:51,347 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-08-30 16:50:51,347 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 16:50:51,347 INFO L158 Benchmark]: Toolchain (without parser) took 32912.09ms. Allocated memory was 77.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 51.3MB in the beginning and 785.5MB in the end (delta: -734.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-30 16:50:51,348 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 16:50:51,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.92ms. Allocated memory is still 77.6MB. Free memory was 51.1MB in the beginning and 46.4MB in the end (delta: 4.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-08-30 16:50:51,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.00ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 43.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:51,348 INFO L158 Benchmark]: Boogie Preprocessor took 61.43ms. Allocated memory is still 77.6MB. Free memory was 43.8MB in the beginning and 41.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 16:50:51,349 INFO L158 Benchmark]: RCFGBuilder took 710.72ms. Allocated memory is still 77.6MB. Free memory was 41.4MB in the beginning and 28.9MB in the end (delta: 12.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-08-30 16:50:51,349 INFO L158 Benchmark]: TraceAbstraction took 31484.40ms. Allocated memory was 77.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 53.9MB in the beginning and 801.3MB in the end (delta: -747.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-08-30 16:50:51,349 INFO L158 Benchmark]: Witness Printer took 65.29ms. Allocated memory is still 2.0GB. Free memory was 801.3MB in the beginning and 785.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-08-30 16:50:51,351 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.19ms. Allocated memory is still 58.7MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.92ms. Allocated memory is still 77.6MB. Free memory was 51.1MB in the beginning and 46.4MB in the end (delta: 4.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.00ms. Allocated memory is still 77.6MB. Free memory was 46.4MB in the beginning and 43.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.43ms. Allocated memory is still 77.6MB. Free memory was 43.8MB in the beginning and 41.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 710.72ms. Allocated memory is still 77.6MB. Free memory was 41.4MB in the beginning and 28.9MB in the end (delta: 12.5MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31484.40ms. Allocated memory was 77.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 53.9MB in the beginning and 801.3MB in the end (delta: -747.4MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 65.29ms. Allocated memory is still 2.0GB. Free memory was 801.3MB in the beginning and 785.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.8s, 140 PlacesBefore, 43 PlacesAfterwards, 129 TransitionsBefore, 30 TransitionsAfterwards, 3256 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 111 TotalNumberOfCompositions, 9118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3407, independent: 3160, independent conditional: 0, independent unconditional: 3160, dependent: 247, dependent conditional: 0, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1756, independent: 1714, independent conditional: 0, independent unconditional: 1714, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3407, independent: 1446, independent conditional: 0, independent unconditional: 1446, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 1756, unknown conditional: 0, unknown unconditional: 1756] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t993, ((void *)0), P0, ((void *)0))=-2, t993={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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t994, ((void *)0), P1, ((void *)0))=-1, t993={5:0}, t994={6: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t995, ((void *)0), P2, ((void *)0))=0, t993={5:0}, t994={6:0}, t995={7: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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t996, ((void *)0), P3, ((void *)0))=1, t993={5:0}, t994={6:0}, t995={7:0}, t996={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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L760] 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) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 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 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 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, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 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) [L883] 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)) [L884] 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)) [L885] 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)) [L886] 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)) [L887] 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)) [L888] 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)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 861]: 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: 863]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 171 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1060 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 375 mSDsCounter, 223 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2477 IncrementalHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 223 mSolverCounterUnsat, 195 mSDtfsCounter, 2477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=11, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 3804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-30 16:50:51,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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