./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:48:43,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:48:43,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:48:43,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:48:43,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:48:43,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:48:43,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:48:43,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:48:43,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:48:43,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:48:43,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:48:43,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:48:43,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:48:43,385 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:48:43,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:48:43,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:48:43,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:48:43,394 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:48:43,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:48:43,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:48:43,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:48:43,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:48:43,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:48:43,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:48:43,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:48:43,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:48:43,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:48:43,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:48:43,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:48:43,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:48:43,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:48:43,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:48:43,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:48:43,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:48:43,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:48:43,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:48:43,424 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:48:43,424 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:48:43,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:48:43,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:48:43,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:48:43,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:48:43,459 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:48:43,460 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:48:43,461 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:48:43,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:48:43,462 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:48:43,462 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:48:43,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:48:43,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:48:43,463 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:48:43,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:48:43,464 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:48:43,464 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:48:43,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:48:43,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:48:43,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:48:43,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:48:43,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:48:43,465 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:48:43,465 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:48:43,465 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:48:43,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:48:43,466 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:48:43,466 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:48:43,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:48:43,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:48:43,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:48:43,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:48:43,467 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:48:43,467 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:48:43,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:48:43,467 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:48:43,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:48:43,468 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:48:43,468 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:48:43,468 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:48:43,468 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 -> a6d0914923ba77f2cbf67d52dc6ec759519359118cb2f8fd5f254f95bf2b938e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:48:43,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:48:43,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:48:43,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:48:43,799 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:48:43,799 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:48:43,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:48:44,869 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:48:45,146 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:48:45,147 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:48:45,157 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782681e2/e087b1961d1a4b51923a8960d03fbee4/FLAG7d66df14a [2023-09-01 09:48:45,171 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1782681e2/e087b1961d1a4b51923a8960d03fbee4 [2023-09-01 09:48:45,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:48:45,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:48:45,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:48:45,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:48:45,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:48:45,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10aca668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45, skipping insertion in model container [2023-09-01 09:48:45,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:48:45,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:48:45,412 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/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:48:45,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:48:45,681 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:48:45,693 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/mix030_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-09-01 09:48:45,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:48:45,789 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:48:45,790 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:48:45,796 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:48:45,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45 WrapperNode [2023-09-01 09:48:45,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:48:45,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:48:45,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:48:45,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:48:45,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,844 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,880 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-09-01 09:48:45,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:48:45,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:48:45,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:48:45,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:48:45,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,905 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,906 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,928 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:48:45,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:48:45,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:48:45,943 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:48:45,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (1/1) ... [2023-09-01 09:48:45,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:48:45,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:48:45,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:48:45,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:48:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:48:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:48:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:48:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:48:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:48:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:48:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:48:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:48:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:48:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:48:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:48:46,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:48:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:48:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:48:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:48:46,008 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:48:46,154 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:48:46,156 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:48:46,464 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:48:46,654 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:48:46,657 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:48:46,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:46 BoogieIcfgContainer [2023-09-01 09:48:46,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:48:46,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:48:46,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:48:46,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:48:46,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:48:45" (1/3) ... [2023-09-01 09:48:46,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6437ef7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:48:46, skipping insertion in model container [2023-09-01 09:48:46,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:48:45" (2/3) ... [2023-09-01 09:48:46,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6437ef7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:48:46, skipping insertion in model container [2023-09-01 09:48:46,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:46" (3/3) ... [2023-09-01 09:48:46,668 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.oepc_pso.oepc_rmo.oepc.i [2023-09-01 09:48:46,677 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:48:46,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:48:46,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:48:46,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:48:46,765 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:48:46,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-09-01 09:48:46,863 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-09-01 09:48:46,864 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:46,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-09-01 09:48:46,870 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-09-01 09:48:46,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:46,881 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:48:46,889 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:46,891 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:46,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-09-01 09:48:46,926 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2023-09-01 09:48:46,927 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:46,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-09-01 09:48:46,930 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-09-01 09:48:50,716 INFO L134 LiptonReduction]: Checked pairs total: 9265 [2023-09-01 09:48:50,716 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-09-01 09:48:50,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:48:50,734 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;@5ccb8c02, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:48:50,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:48:50,737 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-09-01 09:48:50,738 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:48:50,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:50,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 09:48:50,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:50,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash 543580, now seen corresponding path program 1 times [2023-09-01 09:48:50,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:50,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907322747] [2023-09-01 09:48:50,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:51,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:51,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:51,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907322747] [2023-09-01 09:48:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907322747] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:51,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:51,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:51,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705122552] [2023-09-01 09:48:51,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:51,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:51,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 236 [2023-09-01 09:48:51,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:51,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:51,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 236 [2023-09-01 09:48:51,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:52,195 INFO L130 PetriNetUnfolder]: 4903/6757 cut-off events. [2023-09-01 09:48:52,195 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-09-01 09:48:52,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13605 conditions, 6757 events. 4903/6757 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 32817 event pairs, 2535 based on Foata normal form. 0/6419 useless extension candidates. Maximal degree in co-relation 13593. Up to 5335 conditions per place. [2023-09-01 09:48:52,238 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-09-01 09:48:52,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-09-01 09:48:52,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-09-01 09:48:52,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466101694915254 [2023-09-01 09:48:52,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-09-01 09:48:52,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-09-01 09:48:52,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:52,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-09-01 09:48:52,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:52,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:52,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:52,272 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 387 transitions. [2023-09-01 09:48:52,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-09-01 09:48:52,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:48:52,277 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-09-01 09:48:52,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-09-01 09:48:52,282 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-09-01 09:48:52,282 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-09-01 09:48:52,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:52,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:52,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:52,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:48:52,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:52,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -855392563, now seen corresponding path program 1 times [2023-09-01 09:48:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975794394] [2023-09-01 09:48:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:52,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975794394] [2023-09-01 09:48:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975794394] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:52,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496318836] [2023-09-01 09:48:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:52,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:52,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:48:52,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:52,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:52,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:48:52,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:54,965 INFO L130 PetriNetUnfolder]: 16443/22329 cut-off events. [2023-09-01 09:48:54,966 INFO L131 PetriNetUnfolder]: For 1116/1116 co-relation queries the response was YES. [2023-09-01 09:48:55,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46175 conditions, 22329 events. 16443/22329 cut-off events. For 1116/1116 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 116583 event pairs, 6427 based on Foata normal form. 704/23033 useless extension candidates. Maximal degree in co-relation 46165. Up to 11662 conditions per place. [2023-09-01 09:48:55,091 INFO L137 encePairwiseOnDemand]: 226/236 looper letters, 42 selfloop transitions, 9 changer transitions 0/51 dead transitions. [2023-09-01 09:48:55,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 222 flow [2023-09-01 09:48:55,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-09-01 09:48:55,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056497175141242 [2023-09-01 09:48:55,095 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-09-01 09:48:55,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-09-01 09:48:55,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:55,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-09-01 09:48:55,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:55,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:55,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:55,101 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 358 transitions. [2023-09-01 09:48:55,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 222 flow [2023-09-01 09:48:55,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:55,104 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 134 flow [2023-09-01 09:48:55,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2023-09-01 09:48:55,105 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-09-01 09:48:55,106 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 134 flow [2023-09-01 09:48:55,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:55,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:55,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:55,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:48:55,107 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:55,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -747366534, now seen corresponding path program 1 times [2023-09-01 09:48:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023278331] [2023-09-01 09:48:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:55,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:55,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023278331] [2023-09-01 09:48:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023278331] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:55,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:55,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:48:55,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157004553] [2023-09-01 09:48:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:55,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:48:55,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:48:55,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:48:55,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 236 [2023-09-01 09:48:55,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:55,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:55,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 236 [2023-09-01 09:48:55,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:57,124 INFO L130 PetriNetUnfolder]: 13792/19387 cut-off events. [2023-09-01 09:48:57,124 INFO L131 PetriNetUnfolder]: For 8587/8655 co-relation queries the response was YES. [2023-09-01 09:48:57,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48562 conditions, 19387 events. 13792/19387 cut-off events. For 8587/8655 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 110492 event pairs, 2825 based on Foata normal form. 30/19019 useless extension candidates. Maximal degree in co-relation 48550. Up to 16849 conditions per place. [2023-09-01 09:48:57,262 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 42 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-09-01 09:48:57,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 288 flow [2023-09-01 09:48:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:48:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:48:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-09-01 09:48:57,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2023-09-01 09:48:57,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-09-01 09:48:57,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-09-01 09:48:57,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:57,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-09-01 09:48:57,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:57,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:57,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:57,269 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 134 flow. Second operand 3 states and 372 transitions. [2023-09-01 09:48:57,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 288 flow [2023-09-01 09:48:57,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:57,293 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 157 flow [2023-09-01 09:48:57,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-09-01 09:48:57,294 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-09-01 09:48:57,297 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 157 flow [2023-09-01 09:48:57,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:57,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:57,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:57,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:48:57,299 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:57,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash -747367526, now seen corresponding path program 1 times [2023-09-01 09:48:57,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:57,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693298724] [2023-09-01 09:48:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:57,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:57,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:57,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693298724] [2023-09-01 09:48:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693298724] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:57,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:57,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:48:57,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411171863] [2023-09-01 09:48:57,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:57,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:57,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:57,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:57,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:57,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:48:57,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:57,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:57,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:48:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:59,121 INFO L130 PetriNetUnfolder]: 15855/21541 cut-off events. [2023-09-01 09:48:59,122 INFO L131 PetriNetUnfolder]: For 6893/6893 co-relation queries the response was YES. [2023-09-01 09:48:59,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54625 conditions, 21541 events. 15855/21541 cut-off events. For 6893/6893 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 114322 event pairs, 2367 based on Foata normal form. 50/21591 useless extension candidates. Maximal degree in co-relation 54612. Up to 10700 conditions per place. [2023-09-01 09:48:59,206 INFO L137 encePairwiseOnDemand]: 226/236 looper letters, 68 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2023-09-01 09:48:59,207 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 462 flow [2023-09-01 09:48:59,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:48:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:48:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-09-01 09:48:59,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5084745762711864 [2023-09-01 09:48:59,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-09-01 09:48:59,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-09-01 09:48:59,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:59,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-09-01 09:48:59,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:59,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:59,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:59,214 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 157 flow. Second operand 4 states and 480 transitions. [2023-09-01 09:48:59,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 462 flow [2023-09-01 09:48:59,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:59,216 INFO L231 Difference]: Finished difference. Result has 47 places, 51 transitions, 284 flow [2023-09-01 09:48:59,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=284, PETRI_PLACES=47, PETRI_TRANSITIONS=51} [2023-09-01 09:48:59,217 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2023-09-01 09:48:59,217 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 51 transitions, 284 flow [2023-09-01 09:48:59,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:59,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:59,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:59,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:48:59,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:59,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1693527923, now seen corresponding path program 1 times [2023-09-01 09:48:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:59,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672559886] [2023-09-01 09:48:59,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:59,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:48:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:59,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672559886] [2023-09-01 09:48:59,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672559886] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:59,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:59,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:48:59,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445800047] [2023-09-01 09:48:59,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:59,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:48:59,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:59,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:48:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:48:59,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:48:59,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 51 transitions, 284 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:59,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:59,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:48:59,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:01,007 INFO L130 PetriNetUnfolder]: 15602/21203 cut-off events. [2023-09-01 09:49:01,007 INFO L131 PetriNetUnfolder]: For 21500/21500 co-relation queries the response was YES. [2023-09-01 09:49:01,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62925 conditions, 21203 events. 15602/21203 cut-off events. For 21500/21500 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 110678 event pairs, 1509 based on Foata normal form. 40/21243 useless extension candidates. Maximal degree in co-relation 62908. Up to 10368 conditions per place. [2023-09-01 09:49:01,123 INFO L137 encePairwiseOnDemand]: 226/236 looper letters, 69 selfloop transitions, 23 changer transitions 0/92 dead transitions. [2023-09-01 09:49:01,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 640 flow [2023-09-01 09:49:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-09-01 09:49:01,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2023-09-01 09:49:01,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-09-01 09:49:01,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-09-01 09:49:01,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:01,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-09-01 09:49:01,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:01,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:01,131 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:01,131 INFO L175 Difference]: Start difference. First operand has 47 places, 51 transitions, 284 flow. Second operand 4 states and 476 transitions. [2023-09-01 09:49:01,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 640 flow [2023-09-01 09:49:01,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 640 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:49:01,168 INFO L231 Difference]: Finished difference. Result has 53 places, 62 transitions, 478 flow [2023-09-01 09:49:01,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=53, PETRI_TRANSITIONS=62} [2023-09-01 09:49:01,170 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2023-09-01 09:49:01,170 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 478 flow [2023-09-01 09:49:01,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:01,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:01,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:01,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:49:01,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:01,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:01,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1948737400, now seen corresponding path program 1 times [2023-09-01 09:49:01,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:01,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068906948] [2023-09-01 09:49:01,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:01,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068906948] [2023-09-01 09:49:01,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068906948] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:01,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:01,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:49:01,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618443261] [2023-09-01 09:49:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:01,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:01,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:01,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:01,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:49:01,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:01,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:01,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:49:01,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:03,216 INFO L130 PetriNetUnfolder]: 14856/20185 cut-off events. [2023-09-01 09:49:03,216 INFO L131 PetriNetUnfolder]: For 54798/54798 co-relation queries the response was YES. [2023-09-01 09:49:03,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68418 conditions, 20185 events. 14856/20185 cut-off events. For 54798/54798 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 101762 event pairs, 3107 based on Foata normal form. 122/20307 useless extension candidates. Maximal degree in co-relation 68396. Up to 8076 conditions per place. [2023-09-01 09:49:03,362 INFO L137 encePairwiseOnDemand]: 227/236 looper letters, 83 selfloop transitions, 21 changer transitions 0/104 dead transitions. [2023-09-01 09:49:03,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 104 transitions, 940 flow [2023-09-01 09:49:03,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:03,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-09-01 09:49:03,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957627118644068 [2023-09-01 09:49:03,366 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-09-01 09:49:03,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-09-01 09:49:03,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:03,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-09-01 09:49:03,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:03,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:03,372 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:03,372 INFO L175 Difference]: Start difference. First operand has 53 places, 62 transitions, 478 flow. Second operand 4 states and 468 transitions. [2023-09-01 09:49:03,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 104 transitions, 940 flow [2023-09-01 09:49:03,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 104 transitions, 940 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:49:03,478 INFO L231 Difference]: Finished difference. Result has 59 places, 75 transitions, 742 flow [2023-09-01 09:49:03,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=742, PETRI_PLACES=59, PETRI_TRANSITIONS=75} [2023-09-01 09:49:03,481 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places. [2023-09-01 09:49:03,482 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 75 transitions, 742 flow [2023-09-01 09:49:03,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:03,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:03,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:03,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:49:03,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:03,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash -610816013, now seen corresponding path program 1 times [2023-09-01 09:49:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:03,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186145501] [2023-09-01 09:49:03,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:03,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:03,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:03,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186145501] [2023-09-01 09:49:03,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186145501] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:03,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709442595] [2023-09-01 09:49:03,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:03,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:03,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:03,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:03,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:03,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:49:03,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 75 transitions, 742 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:03,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:03,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:49:03,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:06,238 INFO L130 PetriNetUnfolder]: 20582/28191 cut-off events. [2023-09-01 09:49:06,238 INFO L131 PetriNetUnfolder]: For 108168/108168 co-relation queries the response was YES. [2023-09-01 09:49:06,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99473 conditions, 28191 events. 20582/28191 cut-off events. For 108168/108168 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 156739 event pairs, 3740 based on Foata normal form. 300/28491 useless extension candidates. Maximal degree in co-relation 99446. Up to 11643 conditions per place. [2023-09-01 09:49:06,372 INFO L137 encePairwiseOnDemand]: 226/236 looper letters, 70 selfloop transitions, 44 changer transitions 4/118 dead transitions. [2023-09-01 09:49:06,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 1200 flow [2023-09-01 09:49:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:06,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-09-01 09:49:06,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095338983050848 [2023-09-01 09:49:06,374 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-09-01 09:49:06,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-09-01 09:49:06,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:06,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-09-01 09:49:06,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-09-01 09:49:06,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:06,377 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:06,377 INFO L175 Difference]: Start difference. First operand has 59 places, 75 transitions, 742 flow. Second operand 4 states and 481 transitions. [2023-09-01 09:49:06,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 1200 flow [2023-09-01 09:49:06,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 118 transitions, 1193 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:06,715 INFO L231 Difference]: Finished difference. Result has 64 places, 80 transitions, 1006 flow [2023-09-01 09:49:06,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1006, PETRI_PLACES=64, PETRI_TRANSITIONS=80} [2023-09-01 09:49:06,716 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places. [2023-09-01 09:49:06,716 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 80 transitions, 1006 flow [2023-09-01 09:49:06,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:06,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:06,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:06,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:49:06,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:06,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:06,718 INFO L85 PathProgramCache]: Analyzing trace with hash 312717530, now seen corresponding path program 1 times [2023-09-01 09:49:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031899933] [2023-09-01 09:49:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:06,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:06,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031899933] [2023-09-01 09:49:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031899933] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:06,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002969490] [2023-09-01 09:49:06,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:06,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:06,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:06,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:06,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-09-01 09:49:06,880 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 80 transitions, 1006 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:06,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:06,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-09-01 09:49:06,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:08,693 INFO L130 PetriNetUnfolder]: 12326/18484 cut-off events. [2023-09-01 09:49:08,693 INFO L131 PetriNetUnfolder]: For 97026/99688 co-relation queries the response was YES. [2023-09-01 09:49:08,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63552 conditions, 18484 events. 12326/18484 cut-off events. For 97026/99688 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 123966 event pairs, 1912 based on Foata normal form. 2133/20361 useless extension candidates. Maximal degree in co-relation 63521. Up to 11370 conditions per place. [2023-09-01 09:49:08,801 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 154 selfloop transitions, 10 changer transitions 0/195 dead transitions. [2023-09-01 09:49:08,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 195 transitions, 2624 flow [2023-09-01 09:49:08,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:49:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:49:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-09-01 09:49:08,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059322033898305 [2023-09-01 09:49:08,804 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-09-01 09:49:08,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-09-01 09:49:08,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:08,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-09-01 09:49:08,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:08,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:08,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:08,808 INFO L175 Difference]: Start difference. First operand has 64 places, 80 transitions, 1006 flow. Second operand 5 states and 597 transitions. [2023-09-01 09:49:08,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 195 transitions, 2624 flow [2023-09-01 09:49:08,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 195 transitions, 2616 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-09-01 09:49:08,877 INFO L231 Difference]: Finished difference. Result has 71 places, 89 transitions, 1079 flow [2023-09-01 09:49:08,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1079, PETRI_PLACES=71, PETRI_TRANSITIONS=89} [2023-09-01 09:49:08,877 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-09-01 09:49:08,878 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 89 transitions, 1079 flow [2023-09-01 09:49:08,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:08,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:08,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:08,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:49:08,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:08,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 737192579, now seen corresponding path program 1 times [2023-09-01 09:49:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:08,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074811387] [2023-09-01 09:49:08,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:08,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:09,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:09,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074811387] [2023-09-01 09:49:09,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074811387] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:09,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:09,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773937580] [2023-09-01 09:49:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:09,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:09,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:49:09,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 89 transitions, 1079 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:09,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:09,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:49:09,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:12,864 INFO L130 PetriNetUnfolder]: 24689/35562 cut-off events. [2023-09-01 09:49:12,865 INFO L131 PetriNetUnfolder]: For 219858/219858 co-relation queries the response was YES. [2023-09-01 09:49:12,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157912 conditions, 35562 events. 24689/35562 cut-off events. For 219858/219858 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 230429 event pairs, 6887 based on Foata normal form. 168/35730 useless extension candidates. Maximal degree in co-relation 157876. Up to 15533 conditions per place. [2023-09-01 09:49:13,025 INFO L137 encePairwiseOnDemand]: 226/236 looper letters, 91 selfloop transitions, 40 changer transitions 29/160 dead transitions. [2023-09-01 09:49:13,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 160 transitions, 1948 flow [2023-09-01 09:49:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-09-01 09:49:13,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116525423728814 [2023-09-01 09:49:13,028 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-09-01 09:49:13,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-09-01 09:49:13,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:13,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-09-01 09:49:13,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:13,037 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:13,038 INFO L175 Difference]: Start difference. First operand has 71 places, 89 transitions, 1079 flow. Second operand 4 states and 483 transitions. [2023-09-01 09:49:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 160 transitions, 1948 flow [2023-09-01 09:49:13,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 160 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:13,348 INFO L231 Difference]: Finished difference. Result has 76 places, 87 transitions, 1297 flow [2023-09-01 09:49:13,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1297, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2023-09-01 09:49:13,350 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places. [2023-09-01 09:49:13,350 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 1297 flow [2023-09-01 09:49:13,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:13,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:13,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:13,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:49:13,351 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:13,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash 126999225, now seen corresponding path program 1 times [2023-09-01 09:49:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:13,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910201751] [2023-09-01 09:49:13,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:13,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910201751] [2023-09-01 09:49:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910201751] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:13,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:49:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266929143] [2023-09-01 09:49:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:13,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:49:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:49:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:49:13,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-09-01 09:49:13,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 1297 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:13,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:13,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-09-01 09:49:13,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:15,339 INFO L130 PetriNetUnfolder]: 9406/14857 cut-off events. [2023-09-01 09:49:15,339 INFO L131 PetriNetUnfolder]: For 88002/89152 co-relation queries the response was YES. [2023-09-01 09:49:15,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59669 conditions, 14857 events. 9406/14857 cut-off events. For 88002/89152 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 104763 event pairs, 1199 based on Foata normal form. 1741/16386 useless extension candidates. Maximal degree in co-relation 59629. Up to 5822 conditions per place. [2023-09-01 09:49:15,406 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 175 selfloop transitions, 14 changer transitions 10/230 dead transitions. [2023-09-01 09:49:15,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 230 transitions, 3581 flow [2023-09-01 09:49:15,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:49:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:49:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 719 transitions. [2023-09-01 09:49:15,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507768361581921 [2023-09-01 09:49:15,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 719 transitions. [2023-09-01 09:49:15,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 719 transitions. [2023-09-01 09:49:15,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:15,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 719 transitions. [2023-09-01 09:49:15,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:15,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:15,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:15,413 INFO L175 Difference]: Start difference. First operand has 76 places, 87 transitions, 1297 flow. Second operand 6 states and 719 transitions. [2023-09-01 09:49:15,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 230 transitions, 3581 flow [2023-09-01 09:49:15,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 230 transitions, 3569 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-09-01 09:49:15,582 INFO L231 Difference]: Finished difference. Result has 81 places, 96 transitions, 1413 flow [2023-09-01 09:49:15,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1413, PETRI_PLACES=81, PETRI_TRANSITIONS=96} [2023-09-01 09:49:15,583 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-09-01 09:49:15,583 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 96 transitions, 1413 flow [2023-09-01 09:49:15,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:15,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:15,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:15,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:49:15,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:15,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:15,585 INFO L85 PathProgramCache]: Analyzing trace with hash 142332991, now seen corresponding path program 1 times [2023-09-01 09:49:15,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:15,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557486839] [2023-09-01 09:49:15,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:15,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:15,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:15,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557486839] [2023-09-01 09:49:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557486839] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:15,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:15,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:49:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41285328] [2023-09-01 09:49:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:15,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:49:15,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:49:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:49:15,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-09-01 09:49:15,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 96 transitions, 1413 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:15,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:15,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-09-01 09:49:15,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:17,624 INFO L130 PetriNetUnfolder]: 8426/13367 cut-off events. [2023-09-01 09:49:17,624 INFO L131 PetriNetUnfolder]: For 87443/88487 co-relation queries the response was YES. [2023-09-01 09:49:17,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62624 conditions, 13367 events. 8426/13367 cut-off events. For 87443/88487 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 93887 event pairs, 931 based on Foata normal form. 843/14003 useless extension candidates. Maximal degree in co-relation 62580. Up to 5454 conditions per place. [2023-09-01 09:49:17,688 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 166 selfloop transitions, 23 changer transitions 54/273 dead transitions. [2023-09-01 09:49:17,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 273 transitions, 4247 flow [2023-09-01 09:49:17,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:49:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:49:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 958 transitions. [2023-09-01 09:49:17,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074152542372882 [2023-09-01 09:49:17,691 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 958 transitions. [2023-09-01 09:49:17,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 958 transitions. [2023-09-01 09:49:17,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:17,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 958 transitions. [2023-09-01 09:49:17,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.75) internal successors, (958), 8 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:17,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:17,697 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:17,697 INFO L175 Difference]: Start difference. First operand has 81 places, 96 transitions, 1413 flow. Second operand 8 states and 958 transitions. [2023-09-01 09:49:17,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 273 transitions, 4247 flow [2023-09-01 09:49:18,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 273 transitions, 4203 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-09-01 09:49:18,735 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 1449 flow [2023-09-01 09:49:18,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1449, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2023-09-01 09:49:18,736 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places. [2023-09-01 09:49:18,736 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 1449 flow [2023-09-01 09:49:18,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:18,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:18,737 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-09-01 09:49:18,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:49:18,738 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:18,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:18,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1146214699, now seen corresponding path program 1 times [2023-09-01 09:49:18,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:18,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445872913] [2023-09-01 09:49:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445872913] [2023-09-01 09:49:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445872913] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:49:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921664952] [2023-09-01 09:49:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:19,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:49:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:49:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:49:19,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-09-01 09:49:19,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 1449 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:19,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:19,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-09-01 09:49:19,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:20,481 INFO L130 PetriNetUnfolder]: 7624/12120 cut-off events. [2023-09-01 09:49:20,482 INFO L131 PetriNetUnfolder]: For 82764/83694 co-relation queries the response was YES. [2023-09-01 09:49:20,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56986 conditions, 12120 events. 7624/12120 cut-off events. For 82764/83694 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 85064 event pairs, 854 based on Foata normal form. 362/12280 useless extension candidates. Maximal degree in co-relation 56939. Up to 3147 conditions per place. [2023-09-01 09:49:20,530 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 92 selfloop transitions, 26 changer transitions 128/258 dead transitions. [2023-09-01 09:49:20,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 258 transitions, 3925 flow [2023-09-01 09:49:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 09:49:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 09:49:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1169 transitions. [2023-09-01 09:49:20,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49533898305084745 [2023-09-01 09:49:20,533 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1169 transitions. [2023-09-01 09:49:20,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1169 transitions. [2023-09-01 09:49:20,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:20,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1169 transitions. [2023-09-01 09:49:20,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.9) internal successors, (1169), 10 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:20,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 236.0) internal successors, (2596), 11 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:20,540 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 236.0) internal successors, (2596), 11 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:20,540 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 1449 flow. Second operand 10 states and 1169 transitions. [2023-09-01 09:49:20,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 258 transitions, 3925 flow [2023-09-01 09:49:22,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 258 transitions, 3805 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-09-01 09:49:22,254 INFO L231 Difference]: Finished difference. Result has 96 places, 66 transitions, 774 flow [2023-09-01 09:49:22,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=774, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2023-09-01 09:49:22,254 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places. [2023-09-01 09:49:22,254 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 774 flow [2023-09-01 09:49:22,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:22,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:22,255 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-09-01 09:49:22,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:49:22,255 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:22,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 655267819, now seen corresponding path program 1 times [2023-09-01 09:49:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:22,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799297704] [2023-09-01 09:49:22,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:23,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:23,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799297704] [2023-09-01 09:49:23,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799297704] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:23,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:23,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:49:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390851146] [2023-09-01 09:49:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:23,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:49:23,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:23,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:49:23,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:49:23,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 236 [2023-09-01 09:49:23,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 66 transitions, 774 flow. Second operand has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:23,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:23,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 236 [2023-09-01 09:49:23,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:24,436 INFO L130 PetriNetUnfolder]: 2737/4374 cut-off events. [2023-09-01 09:49:24,436 INFO L131 PetriNetUnfolder]: For 39724/39724 co-relation queries the response was YES. [2023-09-01 09:49:24,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22858 conditions, 4374 events. 2737/4374 cut-off events. For 39724/39724 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 24428 event pairs, 327 based on Foata normal form. 1/4375 useless extension candidates. Maximal degree in co-relation 22809. Up to 1727 conditions per place. [2023-09-01 09:49:24,463 INFO L137 encePairwiseOnDemand]: 222/236 looper letters, 63 selfloop transitions, 25 changer transitions 151/239 dead transitions. [2023-09-01 09:49:24,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 239 transitions, 2864 flow [2023-09-01 09:49:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:49:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:49:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1001 transitions. [2023-09-01 09:49:24,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4712806026365348 [2023-09-01 09:49:24,467 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1001 transitions. [2023-09-01 09:49:24,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1001 transitions. [2023-09-01 09:49:24,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:24,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1001 transitions. [2023-09-01 09:49:24,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:24,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 236.0) internal successors, (2360), 10 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:24,473 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 236.0) internal successors, (2360), 10 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:24,473 INFO L175 Difference]: Start difference. First operand has 96 places, 66 transitions, 774 flow. Second operand 9 states and 1001 transitions. [2023-09-01 09:49:24,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 239 transitions, 2864 flow [2023-09-01 09:49:24,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 239 transitions, 2136 flow, removed 82 selfloop flow, removed 23 redundant places. [2023-09-01 09:49:24,593 INFO L231 Difference]: Finished difference. Result has 84 places, 59 transitions, 534 flow [2023-09-01 09:49:24,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=534, PETRI_PLACES=84, PETRI_TRANSITIONS=59} [2023-09-01 09:49:24,594 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2023-09-01 09:49:24,594 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 59 transitions, 534 flow [2023-09-01 09:49:24,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.5) internal successors, (812), 8 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:24,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:24,595 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-09-01 09:49:24,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:49:24,595 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:24,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:24,595 INFO L85 PathProgramCache]: Analyzing trace with hash 253927751, now seen corresponding path program 2 times [2023-09-01 09:49:24,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:24,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790703745] [2023-09-01 09:49:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:49:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:49:24,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:49:24,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790703745] [2023-09-01 09:49:24,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790703745] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:49:24,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:49:24,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:49:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604709086] [2023-09-01 09:49:24,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:49:24,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:49:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:49:24,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:49:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:49:24,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-09-01 09:49:24,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 59 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:24,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:49:24,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-09-01 09:49:24,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:49:25,091 INFO L130 PetriNetUnfolder]: 790/1337 cut-off events. [2023-09-01 09:49:25,092 INFO L131 PetriNetUnfolder]: For 3601/3601 co-relation queries the response was YES. [2023-09-01 09:49:25,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 1337 events. 790/1337 cut-off events. For 3601/3601 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6117 event pairs, 201 based on Foata normal form. 1/1338 useless extension candidates. Maximal degree in co-relation 5173. Up to 794 conditions per place. [2023-09-01 09:49:25,098 INFO L137 encePairwiseOnDemand]: 227/236 looper letters, 48 selfloop transitions, 6 changer transitions 40/94 dead transitions. [2023-09-01 09:49:25,099 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 900 flow [2023-09-01 09:49:25,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:49:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:49:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-09-01 09:49:25,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4936440677966102 [2023-09-01 09:49:25,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-09-01 09:49:25,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-09-01 09:49:25,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:49:25,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-09-01 09:49:25,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:25,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:25,106 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:25,106 INFO L175 Difference]: Start difference. First operand has 84 places, 59 transitions, 534 flow. Second operand 4 states and 466 transitions. [2023-09-01 09:49:25,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 900 flow [2023-09-01 09:49:25,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 94 transitions, 867 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-09-01 09:49:25,121 INFO L231 Difference]: Finished difference. Result has 73 places, 40 transitions, 268 flow [2023-09-01 09:49:25,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=73, PETRI_TRANSITIONS=40} [2023-09-01 09:49:25,123 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places. [2023-09-01 09:49:25,123 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 40 transitions, 268 flow [2023-09-01 09:49:25,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:49:25,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:49:25,123 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-09-01 09:49:25,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:49:25,124 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:49:25,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:49:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1711870533, now seen corresponding path program 3 times [2023-09-01 09:49:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:49:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238751550] [2023-09-01 09:49:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:49:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:49:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:49:25,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:49:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:49:25,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:49:25,302 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:49:25,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:49:25,304 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:49:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:49:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:49:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:49:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:49:25,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:49:25,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:49:25,306 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:49:25,311 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:49:25,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:49:25,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:49:25 BasicIcfg [2023-09-01 09:49:25,386 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:49:25,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:49:25,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:49:25,387 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:49:25,387 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:48:46" (3/4) ... [2023-09-01 09:49:25,391 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:49:25,518 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:49:25,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:49:25,519 INFO L158 Benchmark]: Toolchain (without parser) took 40345.73ms. Allocated memory was 67.1MB in the beginning and 7.7GB in the end (delta: 7.7GB). Free memory was 43.1MB in the beginning and 6.9GB in the end (delta: -6.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-09-01 09:49:25,519 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 44.2MB in the beginning and 44.1MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:49:25,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.98ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 43.0MB in the beginning and 73.9MB in the end (delta: -31.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2023-09-01 09:49:25,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.41ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 71.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:49:25,520 INFO L158 Benchmark]: Boogie Preprocessor took 59.89ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:49:25,521 INFO L158 Benchmark]: RCFGBuilder took 718.16ms. Allocated memory is still 107.0MB. Free memory was 69.2MB in the beginning and 66.6MB in the end (delta: 2.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-09-01 09:49:25,521 INFO L158 Benchmark]: TraceAbstraction took 38723.41ms. Allocated memory was 107.0MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 66.0MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-09-01 09:49:25,521 INFO L158 Benchmark]: Witness Printer took 132.35ms. Allocated memory is still 7.7GB. Free memory was 6.2GB in the beginning and 6.9GB in the end (delta: -656.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:49:25,523 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.20ms. Allocated memory is still 67.1MB. Free memory was 44.2MB in the beginning and 44.1MB in the end (delta: 46.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 619.98ms. Allocated memory was 67.1MB in the beginning and 107.0MB in the end (delta: 39.8MB). Free memory was 43.0MB in the beginning and 73.9MB in the end (delta: -31.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.41ms. Allocated memory is still 107.0MB. Free memory was 73.9MB in the beginning and 71.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.89ms. Allocated memory is still 107.0MB. Free memory was 71.3MB in the beginning and 69.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 718.16ms. Allocated memory is still 107.0MB. Free memory was 69.2MB in the beginning and 66.6MB in the end (delta: 2.6MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * TraceAbstraction took 38723.41ms. Allocated memory was 107.0MB in the beginning and 7.7GB in the end (delta: 7.6GB). Free memory was 66.0MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 132.35ms. Allocated memory is still 7.7GB. Free memory was 6.2GB in the beginning and 6.9GB in the end (delta: -656.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 136 PlacesBefore, 43 PlacesAfterwards, 125 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 9265 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3389, independent: 3136, independent conditional: 0, independent unconditional: 3136, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1693, independent: 1639, independent conditional: 0, independent unconditional: 1639, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3389, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1693, unknown conditional: 0, unknown unconditional: 1693] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, 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_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L862] 0 pthread_t t801; [L863] FCALL, FORK 0 pthread_create(&t801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t801, ((void *)0), P0, ((void *)0))=-3, t801={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t802; [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t802, ((void *)0), P1, ((void *)0))=-2, t801={5:0}, t802={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L866] 0 pthread_t t803; [L867] FCALL, FORK 0 pthread_create(&t803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t803, ((void *)0), P2, ((void *)0))=-1, t801={5:0}, t802={6:0}, t803={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L868] 0 pthread_t t804; [L869] FCALL, FORK 0 pthread_create(&t804, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t804, ((void *)0), P3, ((void *)0))=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L821] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L824] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 4 a$flush_delayed = weak$$choice2 [L827] 4 a$mem_tmp = a [L828] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L829] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L830] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L831] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L832] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L834] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 __unbuffered_p3_EBX = a [L836] 4 a = a$flush_delayed ? a$mem_tmp : a [L837] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L840] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L841] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L842] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L843] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L844] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L876] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L877] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L878] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L879] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t801={5:0}, t802={6:0}, t803={7:0}, t804={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 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_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - 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: 869]: 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. - 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: 867]: 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, 166 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: 38.5s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 866 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 692 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 194 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1663 IncrementalHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 134 mSDtfsCounter, 1663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1449occurred in iteration=11, InterpolantAutomatonStates: 71, 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.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:49:25,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE