./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --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:47:35,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:47:35,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:47:35,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:47:35,421 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:47:35,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:47:35,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:47:35,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:47:35,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:47:35,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:47:35,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:47:35,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:47:35,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:47:35,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:47:35,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:47:35,430 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:47:35,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:47:35,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:47:35,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:47:35,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:47:35,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:47:35,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:47:35,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:47:35,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:47:35,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:47:35,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:47:35,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:47:35,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:47:35,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:47:35,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:47:35,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:47:35,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:47:35,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:47:35,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:47:35,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:47:35,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:47:35,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:47:35,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:47:35,467 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:47:35,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:47:35,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:47:35,469 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:47:35,493 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:47:35,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:47:35,494 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:47:35,494 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:47:35,495 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:47:35,495 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:47:35,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:47:35,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:47:35,497 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:47:35,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:47:35,498 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:47:35,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:47:35,498 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:47:35,498 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:47:35,499 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:47:35,499 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:47:35,499 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:47:35,499 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:47:35,499 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:47:35,499 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:47:35,500 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:47:35,500 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:47:35,500 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:47:35,500 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:47:35,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:47:35,501 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:47:35,501 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:47:35,501 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:47:35,501 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:47:35,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:47:35,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:47:35,502 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:47:35,502 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:47:35,502 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:47:35,502 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:47:35,503 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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 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:47:35,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:47:35,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:47:35,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:47:35,850 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:47:35,850 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:47:35,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-09-01 09:47:37,187 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:47:37,455 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:47:37,456 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_power.opt_tso.opt.i [2023-09-01 09:47:37,476 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342acd9ef/45bc79b861a146f497a14623cb4f2f87/FLAG7eb11aefa [2023-09-01 09:47:37,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/342acd9ef/45bc79b861a146f497a14623cb4f2f87 [2023-09-01 09:47:37,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:47:37,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:47:37,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:47:37,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:47:37,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:47:37,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:47:37" (1/1) ... [2023-09-01 09:47:37,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a92aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:37, skipping insertion in model container [2023-09-01 09:47:37,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:47:37" (1/1) ... [2023-09-01 09:47:37,505 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:47:37,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:47:37,740 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/mix026_power.opt_tso.opt.i[1001,1014] [2023-09-01 09:47:37,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:47:37,999 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:47:38,046 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/mix026_power.opt_tso.opt.i[1001,1014] [2023-09-01 09:47:38,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:47:38,138 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:47:38,138 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:47:38,144 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:47:38,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38 WrapperNode [2023-09-01 09:47:38,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:47:38,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:47:38,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:47:38,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:47:38,153 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:47:38" (1/1) ... [2023-09-01 09:47:38,183 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:47:38" (1/1) ... [2023-09-01 09:47:38,226 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-09-01 09:47:38,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:47:38,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:47:38,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:47:38,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:47:38,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,271 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,279 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:47:38,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:47:38,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:47:38,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:47:38,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (1/1) ... [2023-09-01 09:47:38,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:47:38,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:47:38,315 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:47:38,340 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:47:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:47:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:47:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:47:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:47:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:47:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:47:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:47:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:47:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:47:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:47:38,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:47:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:47:38,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:47:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:47:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:47:38,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:47:38,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:47:38,359 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:47:38,555 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:47:38,557 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:47:38,855 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:47:38,973 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:47:38,974 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:47:38,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:47:38 BoogieIcfgContainer [2023-09-01 09:47:38,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:47:38,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:47:38,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:47:38,981 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:47:38,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:47:37" (1/3) ... [2023-09-01 09:47:38,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae38640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:47:38, skipping insertion in model container [2023-09-01 09:47:38,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:47:38" (2/3) ... [2023-09-01 09:47:38,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae38640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:47:38, skipping insertion in model container [2023-09-01 09:47:38,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:47:38" (3/3) ... [2023-09-01 09:47:38,984 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-09-01 09:47:38,992 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:47:39,001 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:47:39,001 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-09-01 09:47:39,001 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:47:39,056 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:47:39,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:47:39,175 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:47:39,175 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:47:39,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:47:39,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 130 transitions, 280 flow [2023-09-01 09:47:39,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 126 transitions, 264 flow [2023-09-01 09:47:39,194 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:47:39,209 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:47:39,213 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 126 transitions, 264 flow [2023-09-01 09:47:39,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 126 transitions, 264 flow [2023-09-01 09:47:39,247 INFO L130 PetriNetUnfolder]: 2/126 cut-off events. [2023-09-01 09:47:39,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:47:39,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 09:47:39,252 INFO L119 LiptonReduction]: Number of co-enabled transitions 3000 [2023-09-01 09:47:43,261 INFO L134 LiptonReduction]: Checked pairs total: 7767 [2023-09-01 09:47:43,262 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-09-01 09:47:43,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:47:43,279 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;@6c54fc3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:47:43,279 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-09-01 09:47:43,283 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2023-09-01 09:47:43,283 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:47:43,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:43,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 09:47:43,284 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:43,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:43,288 INFO L85 PathProgramCache]: Analyzing trace with hash 514990672, now seen corresponding path program 1 times [2023-09-01 09:47:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558165628] [2023-09-01 09:47:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:43,666 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:47:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558165628] [2023-09-01 09:47:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558165628] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:43,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:43,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:47:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331351464] [2023-09-01 09:47:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:43,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:47:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:47:43,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:47:43,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-09-01 09:47:43,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:47:43,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:43,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-09-01 09:47:43,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:44,543 INFO L130 PetriNetUnfolder]: 3927/5792 cut-off events. [2023-09-01 09:47:44,543 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-09-01 09:47:44,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 5792 events. 3927/5792 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 32920 event pairs, 717 based on Foata normal form. 0/5464 useless extension candidates. Maximal degree in co-relation 11332. Up to 4291 conditions per place. [2023-09-01 09:47:44,584 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-09-01 09:47:44,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 190 flow [2023-09-01 09:47:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:47:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:47:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-09-01 09:47:44,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5443037974683544 [2023-09-01 09:47:44,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-09-01 09:47:44,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-09-01 09:47:44,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:44,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-09-01 09:47:44,613 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:47:44,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 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:47:44,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 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:47:44,621 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 387 transitions. [2023-09-01 09:47:44,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 190 flow [2023-09-01 09:47:44,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:47:44,629 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-09-01 09:47:44,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-09-01 09:47:44,635 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-09-01 09:47:44,636 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-09-01 09:47:44,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:47:44,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:44,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:44,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:47:44,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:44,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2000565703, now seen corresponding path program 1 times [2023-09-01 09:47:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:44,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881071199] [2023-09-01 09:47:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:45,027 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:47:45,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:45,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881071199] [2023-09-01 09:47:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881071199] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:47:45,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151234435] [2023-09-01 09:47:45,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:45,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:47:45,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:47:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:47:45,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:47:45,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:47:45,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:45,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:47:45,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:46,602 INFO L130 PetriNetUnfolder]: 11225/15342 cut-off events. [2023-09-01 09:47:46,603 INFO L131 PetriNetUnfolder]: For 792/792 co-relation queries the response was YES. [2023-09-01 09:47:46,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31828 conditions, 15342 events. 11225/15342 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 77111 event pairs, 3963 based on Foata normal form. 368/15710 useless extension candidates. Maximal degree in co-relation 31818. Up to 10655 conditions per place. [2023-09-01 09:47:46,700 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-09-01 09:47:46,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 224 flow [2023-09-01 09:47:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:47:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:47:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-09-01 09:47:46,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5203938115330521 [2023-09-01 09:47:46,703 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-09-01 09:47:46,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-09-01 09:47:46,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:46,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-09-01 09:47:46,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:46,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 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:47:46,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 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:47:46,707 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 370 transitions. [2023-09-01 09:47:46,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 224 flow [2023-09-01 09:47:46,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:46,710 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 116 flow [2023-09-01 09:47:46,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-09-01 09:47:46,712 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-09-01 09:47:46,712 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 116 flow [2023-09-01 09:47:46,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:47:46,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:46,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:46,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:47:46,713 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:46,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1887992981, now seen corresponding path program 1 times [2023-09-01 09:47:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735164227] [2023-09-01 09:47:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:46,941 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:47:46,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:46,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735164227] [2023-09-01 09:47:46,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735164227] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:46,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:46,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:47:46,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824902362] [2023-09-01 09:47:46,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:46,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:46,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:46,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:47:46,965 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 116 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:47:46,965 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:46,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:47:46,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:48,394 INFO L130 PetriNetUnfolder]: 10397/14226 cut-off events. [2023-09-01 09:47:48,394 INFO L131 PetriNetUnfolder]: For 4696/4696 co-relation queries the response was YES. [2023-09-01 09:47:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34718 conditions, 14226 events. 10397/14226 cut-off events. For 4696/4696 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 69493 event pairs, 2875 based on Foata normal form. 180/14406 useless extension candidates. Maximal degree in co-relation 34706. Up to 6993 conditions per place. [2023-09-01 09:47:48,464 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 52 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-09-01 09:47:48,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 302 flow [2023-09-01 09:47:48,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-09-01 09:47:48,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052742616033755 [2023-09-01 09:47:48,467 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-09-01 09:47:48,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-09-01 09:47:48,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:48,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-09-01 09:47:48,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:47:48,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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:47:48,472 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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:47:48,472 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 116 flow. Second operand 4 states and 479 transitions. [2023-09-01 09:47:48,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 302 flow [2023-09-01 09:47:48,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:48,496 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 150 flow [2023-09-01 09:47:48,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-09-01 09:47:48,497 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-09-01 09:47:48,497 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 150 flow [2023-09-01 09:47:48,497 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:47:48,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:48,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:48,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:47:48,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:48,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1640365980, now seen corresponding path program 1 times [2023-09-01 09:47:48,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:48,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620448147] [2023-09-01 09:47:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:48,712 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:47:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620448147] [2023-09-01 09:47:48,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620448147] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:48,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:48,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:48,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592577647] [2023-09-01 09:47:48,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:48,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:48,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-09-01 09:47:48,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:48,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:48,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-09-01 09:47:48,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:49,690 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 92#L845true]) [2023-09-01 09:47:49,691 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:47:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:49,691 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:49,781 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 92#L845true]) [2023-09-01 09:47:49,782 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,782 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,782 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,782 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 125#L838true, P2Thread1of1ForFork2InUse, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 09:47:49,784 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,784 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,784 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,784 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,784 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 34#L880true, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true]) [2023-09-01 09:47:49,785 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,785 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,785 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,785 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:49,848 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([502] L880-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|) (= v_~main$tmp_guard1~0_14 (ite (= (ite (not (and (= v_~z~0_16 2) (= v_~__unbuffered_p1_EAX~0_14 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (= 2 v_~__unbuffered_p3_EAX~0_14) (= v_~__unbuffered_p0_EAX~0_22 0))) 1 0) 0) 0 1)) (= (let ((.cse0 (mod (mod v_~main$tmp_guard1~0_14 256) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_27| 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_27|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_14, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~z~0=v_~z~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][78], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, 125#L838true, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-09-01 09:47:49,849 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,849 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,849 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][71], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, P1Thread1of1ForFork1InUse, 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 34#L880true, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L845true]) [2023-09-01 09:47:49,849 INFO L383 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,850 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,850 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,850 INFO L386 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-09-01 09:47:49,907 INFO L130 PetriNetUnfolder]: 6601/9746 cut-off events. [2023-09-01 09:47:49,908 INFO L131 PetriNetUnfolder]: For 3313/3508 co-relation queries the response was YES. [2023-09-01 09:47:49,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22749 conditions, 9746 events. 6601/9746 cut-off events. For 3313/3508 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 58644 event pairs, 1159 based on Foata normal form. 756/10152 useless extension candidates. Maximal degree in co-relation 22734. Up to 6185 conditions per place. [2023-09-01 09:47:49,972 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 68 selfloop transitions, 10 changer transitions 0/88 dead transitions. [2023-09-01 09:47:49,973 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 88 transitions, 464 flow [2023-09-01 09:47:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:47:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:47:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-09-01 09:47:49,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5215189873417722 [2023-09-01 09:47:49,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-09-01 09:47:49,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-09-01 09:47:49,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:49,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-09-01 09:47:49,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:47:49,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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:47:49,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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:47:49,981 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 150 flow. Second operand 5 states and 618 transitions. [2023-09-01 09:47:49,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 88 transitions, 464 flow [2023-09-01 09:47:49,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:47:49,988 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 222 flow [2023-09-01 09:47:49,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-09-01 09:47:49,990 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-09-01 09:47:49,990 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 222 flow [2023-09-01 09:47:49,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:49,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:49,991 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:47:49,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:47:49,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:49,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1961984327, now seen corresponding path program 1 times [2023-09-01 09:47:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556076553] [2023-09-01 09:47:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:49,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:50,319 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:47:50,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:50,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556076553] [2023-09-01 09:47:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556076553] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:50,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:50,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:47:50,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857954498] [2023-09-01 09:47:50,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:50,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:47:50,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:50,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:47:50,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:47:50,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-09-01 09:47:50,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:47:50,340 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:50,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-09-01 09:47:50,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:51,203 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][75], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, 32#L770true, P3Thread1of1ForFork0InUse, 47#L795true, Black: 164#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork1InUse, Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 167#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 43#P2EXITtrue, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 180#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 92#L845true]) [2023-09-01 09:47:51,204 INFO L383 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2023-09-01 09:47:51,204 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:51,204 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:51,204 INFO L386 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-09-01 09:47:51,268 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([395] L838-->L845: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_100 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~x~0_38 (ite .cse0 v_~x$w_buff0~0_35 (ite .cse1 v_~x$w_buff1~0_28 v_~x~0_39))) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_24) v_~x$r_buff0_thd4~0_23) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_23 256) 0)))) 0 v_~x$r_buff1_thd4~0_20)) (= (ite .cse0 0 v_~x$w_buff0_used~0_100) v_~x$w_buff0_used~0_99) (= v_~x$w_buff1_used~0_92 (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_93))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_24, ~x~0=v_~x~0_39, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_35, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_23, ~x~0=v_~x~0_38, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][111], [Black: 156#(= ~__unbuffered_p3_EAX~0 0), Black: 157#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 154#true, 162#true, P3Thread1of1ForFork0InUse, 47#L795true, Black: 164#(= ~__unbuffered_cnt~0 0), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), P1Thread1of1ForFork1InUse, 43#P2EXITtrue, Black: 167#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, 112#P0EXITtrue, Black: 150#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 45#L873true, 176#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 92#L845true]) [2023-09-01 09:47:51,268 INFO L383 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2023-09-01 09:47:51,268 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:51,268 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:51,269 INFO L386 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-09-01 09:47:51,366 INFO L130 PetriNetUnfolder]: 5285/8056 cut-off events. [2023-09-01 09:47:51,366 INFO L131 PetriNetUnfolder]: For 5462/5547 co-relation queries the response was YES. [2023-09-01 09:47:51,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24226 conditions, 8056 events. 5285/8056 cut-off events. For 5462/5547 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 49612 event pairs, 557 based on Foata normal form. 503/8327 useless extension candidates. Maximal degree in co-relation 24207. Up to 2549 conditions per place. [2023-09-01 09:47:51,416 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 93 selfloop transitions, 19 changer transitions 1/123 dead transitions. [2023-09-01 09:47:51,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 123 transitions, 744 flow [2023-09-01 09:47:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:47:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:47:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 867 transitions. [2023-09-01 09:47:51,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5226039783001808 [2023-09-01 09:47:51,420 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 867 transitions. [2023-09-01 09:47:51,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 867 transitions. [2023-09-01 09:47:51,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:51,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 867 transitions. [2023-09-01 09:47:51,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 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:47:51,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:47:51,427 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:47:51,427 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 222 flow. Second operand 7 states and 867 transitions. [2023-09-01 09:47:51,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 123 transitions, 744 flow [2023-09-01 09:47:51,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 123 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:47:51,462 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 351 flow [2023-09-01 09:47:51,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=351, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-09-01 09:47:51,464 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-09-01 09:47:51,465 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 351 flow [2023-09-01 09:47:51,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:47:51,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:51,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:51,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:47:51,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:51,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1254189260, now seen corresponding path program 1 times [2023-09-01 09:47:51,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:51,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216099766] [2023-09-01 09:47:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:51,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:51,814 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:47:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216099766] [2023-09-01 09:47:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216099766] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:51,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756165125] [2023-09-01 09:47:51,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:51,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:51,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:51,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:47:51,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:51,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:51,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:47:51,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:53,300 INFO L130 PetriNetUnfolder]: 8910/13038 cut-off events. [2023-09-01 09:47:53,301 INFO L131 PetriNetUnfolder]: For 30654/30654 co-relation queries the response was YES. [2023-09-01 09:47:53,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48968 conditions, 13038 events. 8910/13038 cut-off events. For 30654/30654 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 75076 event pairs, 972 based on Foata normal form. 65/13103 useless extension candidates. Maximal degree in co-relation 48945. Up to 6108 conditions per place. [2023-09-01 09:47:53,360 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 107 selfloop transitions, 21 changer transitions 36/164 dead transitions. [2023-09-01 09:47:53,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 164 transitions, 1397 flow [2023-09-01 09:47:53,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:47:53,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:47:53,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 613 transitions. [2023-09-01 09:47:53,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172995780590718 [2023-09-01 09:47:53,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 613 transitions. [2023-09-01 09:47:53,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 613 transitions. [2023-09-01 09:47:53,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:53,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 613 transitions. [2023-09-01 09:47:53,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.6) internal successors, (613), 5 states have internal predecessors, (613), 0 states have call successors, (0), 0 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:47:53,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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:47:53,368 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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:47:53,368 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 351 flow. Second operand 5 states and 613 transitions. [2023-09-01 09:47:53,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 164 transitions, 1397 flow [2023-09-01 09:47:53,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 164 transitions, 1225 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-09-01 09:47:53,721 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 389 flow [2023-09-01 09:47:53,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-09-01 09:47:53,724 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2023-09-01 09:47:53,725 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 389 flow [2023-09-01 09:47:53,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:53,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:53,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:53,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:47:53,726 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:53,726 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash -912923184, now seen corresponding path program 2 times [2023-09-01 09:47:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:53,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484771475] [2023-09-01 09:47:53,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:53,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:47:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484771475] [2023-09-01 09:47:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484771475] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094459297] [2023-09-01 09:47:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:53,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:53,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:54,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 237 [2023-09-01 09:47:54,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 389 flow. Second operand has 4 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:47:54,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:54,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 237 [2023-09-01 09:47:54,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:55,015 INFO L130 PetriNetUnfolder]: 4414/6990 cut-off events. [2023-09-01 09:47:55,015 INFO L131 PetriNetUnfolder]: For 15064/15243 co-relation queries the response was YES. [2023-09-01 09:47:55,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25996 conditions, 6990 events. 4414/6990 cut-off events. For 15064/15243 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 41835 event pairs, 944 based on Foata normal form. 105/6962 useless extension candidates. Maximal degree in co-relation 25970. Up to 3553 conditions per place. [2023-09-01 09:47:55,068 INFO L137 encePairwiseOnDemand]: 234/237 looper letters, 70 selfloop transitions, 4 changer transitions 12/101 dead transitions. [2023-09-01 09:47:55,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 101 transitions, 801 flow [2023-09-01 09:47:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:47:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:47:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-09-01 09:47:55,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5316455696202531 [2023-09-01 09:47:55,071 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-09-01 09:47:55,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-09-01 09:47:55,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:55,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-09-01 09:47:55,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 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:47:55,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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:47:55,075 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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:47:55,076 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 389 flow. Second operand 4 states and 504 transitions. [2023-09-01 09:47:55,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 101 transitions, 801 flow [2023-09-01 09:47:55,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 761 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-09-01 09:47:55,130 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 387 flow [2023-09-01 09:47:55,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=387, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-09-01 09:47:55,131 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2023-09-01 09:47:55,131 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 387 flow [2023-09-01 09:47:55,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:47:55,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:55,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:47:55,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:47:55,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:55,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:55,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1010824901, now seen corresponding path program 1 times [2023-09-01 09:47:55,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:55,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963975876] [2023-09-01 09:47:55,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:55,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:55,470 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:47:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963975876] [2023-09-01 09:47:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963975876] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:55,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:47:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529712011] [2023-09-01 09:47:55,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:55,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:47:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:55,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:47:55,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:47:55,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-09-01 09:47:55,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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:47:55,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:55,489 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-09-01 09:47:55,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:56,340 INFO L130 PetriNetUnfolder]: 3529/5649 cut-off events. [2023-09-01 09:47:56,340 INFO L131 PetriNetUnfolder]: For 9273/9380 co-relation queries the response was YES. [2023-09-01 09:47:56,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19234 conditions, 5649 events. 3529/5649 cut-off events. For 9273/9380 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 34128 event pairs, 553 based on Foata normal form. 373/5912 useless extension candidates. Maximal degree in co-relation 19209. Up to 1794 conditions per place. [2023-09-01 09:47:56,371 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 93 selfloop transitions, 18 changer transitions 17/147 dead transitions. [2023-09-01 09:47:56,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 147 transitions, 1147 flow [2023-09-01 09:47:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:47:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:47:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-09-01 09:47:56,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232067510548524 [2023-09-01 09:47:56,375 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-09-01 09:47:56,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-09-01 09:47:56,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:56,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-09-01 09:47:56,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:56,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:47:56,381 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:47:56,381 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 387 flow. Second operand 7 states and 868 transitions. [2023-09-01 09:47:56,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 147 transitions, 1147 flow [2023-09-01 09:47:56,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 147 transitions, 1116 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:56,404 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 512 flow [2023-09-01 09:47:56,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=512, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2023-09-01 09:47:56,405 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-09-01 09:47:56,405 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 512 flow [2023-09-01 09:47:56,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 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:47:56,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:56,406 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:47:56,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:47:56,406 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:56,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1470582725, now seen corresponding path program 1 times [2023-09-01 09:47:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453857993] [2023-09-01 09:47:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:56,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:56,708 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:47:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453857993] [2023-09-01 09:47:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453857993] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:56,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:56,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902779224] [2023-09-01 09:47:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:56,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:56,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:56,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:56,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:56,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 237 [2023-09-01 09:47:56,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 512 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:47:56,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:56,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 237 [2023-09-01 09:47:56,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:57,558 INFO L130 PetriNetUnfolder]: 5516/8455 cut-off events. [2023-09-01 09:47:57,558 INFO L131 PetriNetUnfolder]: For 26461/26461 co-relation queries the response was YES. [2023-09-01 09:47:57,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35090 conditions, 8455 events. 5516/8455 cut-off events. For 26461/26461 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 48326 event pairs, 573 based on Foata normal form. 12/8467 useless extension candidates. Maximal degree in co-relation 35062. Up to 3927 conditions per place. [2023-09-01 09:47:57,597 INFO L137 encePairwiseOnDemand]: 228/237 looper letters, 100 selfloop transitions, 24 changer transitions 24/148 dead transitions. [2023-09-01 09:47:57,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 148 transitions, 1414 flow [2023-09-01 09:47:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:47:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:47:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-09-01 09:47:57,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029535864978903 [2023-09-01 09:47:57,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-09-01 09:47:57,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-09-01 09:47:57,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:57,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-09-01 09:47:57,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 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:47:57,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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:47:57,604 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 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:47:57,604 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 512 flow. Second operand 5 states and 596 transitions. [2023-09-01 09:47:57,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 148 transitions, 1414 flow [2023-09-01 09:47:57,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 148 transitions, 1236 flow, removed 72 selfloop flow, removed 2 redundant places. [2023-09-01 09:47:57,823 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 608 flow [2023-09-01 09:47:57,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2023-09-01 09:47:57,824 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places. [2023-09-01 09:47:57,824 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 608 flow [2023-09-01 09:47:57,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:47:57,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:57,825 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] [2023-09-01 09:47:57,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:47:57,825 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:57,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash 586013674, now seen corresponding path program 1 times [2023-09-01 09:47:57,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:57,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515765398] [2023-09-01 09:47:57,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:57,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:58,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:47:58,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:58,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515765398] [2023-09-01 09:47:58,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515765398] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:58,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:58,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:47:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187180466] [2023-09-01 09:47:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:58,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:47:58,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:58,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:47:58,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:47:58,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-09-01 09:47:58,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 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:47:58,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:58,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-09-01 09:47:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:47:59,291 INFO L130 PetriNetUnfolder]: 4277/7110 cut-off events. [2023-09-01 09:47:59,291 INFO L131 PetriNetUnfolder]: For 18336/18475 co-relation queries the response was YES. [2023-09-01 09:47:59,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27437 conditions, 7110 events. 4277/7110 cut-off events. For 18336/18475 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 47207 event pairs, 656 based on Foata normal form. 40/7030 useless extension candidates. Maximal degree in co-relation 27405. Up to 3345 conditions per place. [2023-09-01 09:47:59,338 INFO L137 encePairwiseOnDemand]: 229/237 looper letters, 102 selfloop transitions, 9 changer transitions 56/192 dead transitions. [2023-09-01 09:47:59,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 192 transitions, 1740 flow [2023-09-01 09:47:59,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:47:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:47:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 853 transitions. [2023-09-01 09:47:59,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5141651597347799 [2023-09-01 09:47:59,341 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 853 transitions. [2023-09-01 09:47:59,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 853 transitions. [2023-09-01 09:47:59,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:47:59,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 853 transitions. [2023-09-01 09:47:59,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.85714285714286) internal successors, (853), 7 states have internal predecessors, (853), 0 states have call successors, (0), 0 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:47:59,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:47:59,348 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 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:47:59,348 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 608 flow. Second operand 7 states and 853 transitions. [2023-09-01 09:47:59,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 192 transitions, 1740 flow [2023-09-01 09:47:59,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 192 transitions, 1700 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-09-01 09:47:59,504 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 655 flow [2023-09-01 09:47:59,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=655, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-09-01 09:47:59,505 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2023-09-01 09:47:59,506 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 655 flow [2023-09-01 09:47:59,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 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:47:59,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:47:59,507 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] [2023-09-01 09:47:59,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:47:59,507 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:47:59,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:47:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1711134967, now seen corresponding path program 1 times [2023-09-01 09:47:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:47:59,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997225360] [2023-09-01 09:47:59,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:47:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:47:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:47:59,761 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:47:59,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:47:59,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997225360] [2023-09-01 09:47:59,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997225360] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:47:59,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:47:59,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:47:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774823647] [2023-09-01 09:47:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:47:59,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:47:59,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:47:59,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:47:59,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:47:59,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-09-01 09:47:59,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 655 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:47:59,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:47:59,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-09-01 09:47:59,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:00,812 INFO L130 PetriNetUnfolder]: 6395/10100 cut-off events. [2023-09-01 09:48:00,812 INFO L131 PetriNetUnfolder]: For 32409/32409 co-relation queries the response was YES. [2023-09-01 09:48:00,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44254 conditions, 10100 events. 6395/10100 cut-off events. For 32409/32409 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 62865 event pairs, 1597 based on Foata normal form. 14/10114 useless extension candidates. Maximal degree in co-relation 44220. Up to 5470 conditions per place. [2023-09-01 09:48:00,851 INFO L137 encePairwiseOnDemand]: 231/237 looper letters, 87 selfloop transitions, 19 changer transitions 27/133 dead transitions. [2023-09-01 09:48:00,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 133 transitions, 1294 flow [2023-09-01 09:48:00,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:48:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:48:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-09-01 09:48:00,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509493670886076 [2023-09-01 09:48:00,853 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-09-01 09:48:00,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-09-01 09:48:00,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:00,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-09-01 09:48:00,855 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:48:00,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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:00,857 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 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:00,857 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 655 flow. Second operand 4 states and 483 transitions. [2023-09-01 09:48:00,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 133 transitions, 1294 flow [2023-09-01 09:48:01,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 133 transitions, 1287 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 09:48:01,147 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 649 flow [2023-09-01 09:48:01,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=649, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-09-01 09:48:01,147 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places. [2023-09-01 09:48:01,147 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 649 flow [2023-09-01 09:48:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:48:01,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:01,148 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] [2023-09-01 09:48:01,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:48:01,148 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:01,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -806853754, now seen corresponding path program 2 times [2023-09-01 09:48:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618310039] [2023-09-01 09:48:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:01,931 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:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618310039] [2023-09-01 09:48:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618310039] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:48:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948453444] [2023-09-01 09:48:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:01,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:48:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:01,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:48:01,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:48:01,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 237 [2023-09-01 09:48:01,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 649 flow. Second operand has 7 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:01,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:01,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 237 [2023-09-01 09:48:01,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:03,304 INFO L130 PetriNetUnfolder]: 7371/12042 cut-off events. [2023-09-01 09:48:03,304 INFO L131 PetriNetUnfolder]: For 42896/42896 co-relation queries the response was YES. [2023-09-01 09:48:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53169 conditions, 12042 events. 7371/12042 cut-off events. For 42896/42896 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 82069 event pairs, 754 based on Foata normal form. 10/12052 useless extension candidates. Maximal degree in co-relation 53133. Up to 5036 conditions per place. [2023-09-01 09:48:03,350 INFO L137 encePairwiseOnDemand]: 224/237 looper letters, 198 selfloop transitions, 55 changer transitions 49/302 dead transitions. [2023-09-01 09:48:03,350 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 302 transitions, 2936 flow [2023-09-01 09:48:03,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-09-01 09:48:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-09-01 09:48:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1066 transitions. [2023-09-01 09:48:03,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4997655883731833 [2023-09-01 09:48:03,353 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1066 transitions. [2023-09-01 09:48:03,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1066 transitions. [2023-09-01 09:48:03,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:03,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1066 transitions. [2023-09-01 09:48:03,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 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:03,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 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:03,359 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 237.0) internal successors, (2370), 10 states have internal predecessors, (2370), 0 states have call successors, (0), 0 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:03,359 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 649 flow. Second operand 9 states and 1066 transitions. [2023-09-01 09:48:03,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 302 transitions, 2936 flow [2023-09-01 09:48:03,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 302 transitions, 2908 flow, removed 14 selfloop flow, removed 0 redundant places. [2023-09-01 09:48:03,642 INFO L231 Difference]: Finished difference. Result has 87 places, 110 transitions, 1279 flow [2023-09-01 09:48:03,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1279, PETRI_PLACES=87, PETRI_TRANSITIONS=110} [2023-09-01 09:48:03,642 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-09-01 09:48:03,643 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 110 transitions, 1279 flow [2023-09-01 09:48:03,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:03,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:03,643 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] [2023-09-01 09:48:03,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:48:03,643 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:03,643 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2123183322, now seen corresponding path program 3 times [2023-09-01 09:48:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:03,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625369731] [2023-09-01 09:48:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:48:03,885 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:03,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:48:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625369731] [2023-09-01 09:48:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625369731] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:48:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:48:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:48:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199300107] [2023-09-01 09:48:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:48:03,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:48:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:48:03,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:48:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:48:03,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 237 [2023-09-01 09:48:03,901 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 110 transitions, 1279 flow. Second operand has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 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:03,901 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:48:03,901 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 237 [2023-09-01 09:48:03,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:48:05,052 INFO L130 PetriNetUnfolder]: 5190/8801 cut-off events. [2023-09-01 09:48:05,052 INFO L131 PetriNetUnfolder]: For 36280/37000 co-relation queries the response was YES. [2023-09-01 09:48:05,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39455 conditions, 8801 events. 5190/8801 cut-off events. For 36280/37000 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 63869 event pairs, 407 based on Foata normal form. 371/8961 useless extension candidates. Maximal degree in co-relation 39413. Up to 3247 conditions per place. [2023-09-01 09:48:05,087 INFO L137 encePairwiseOnDemand]: 230/237 looper letters, 86 selfloop transitions, 17 changer transitions 124/239 dead transitions. [2023-09-01 09:48:05,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 239 transitions, 3013 flow [2023-09-01 09:48:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:48:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:48:05,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 966 transitions. [2023-09-01 09:48:05,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509493670886076 [2023-09-01 09:48:05,091 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 966 transitions. [2023-09-01 09:48:05,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 966 transitions. [2023-09-01 09:48:05,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:48:05,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 966 transitions. [2023-09-01 09:48:05,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 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:05,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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:05,102 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 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:05,102 INFO L175 Difference]: Start difference. First operand has 87 places, 110 transitions, 1279 flow. Second operand 8 states and 966 transitions. [2023-09-01 09:48:05,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 239 transitions, 3013 flow [2023-09-01 09:48:05,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 239 transitions, 2945 flow, removed 32 selfloop flow, removed 1 redundant places. [2023-09-01 09:48:05,528 INFO L231 Difference]: Finished difference. Result has 96 places, 65 transitions, 594 flow [2023-09-01 09:48:05,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=594, PETRI_PLACES=96, PETRI_TRANSITIONS=65} [2023-09-01 09:48:05,529 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2023-09-01 09:48:05,529 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 65 transitions, 594 flow [2023-09-01 09:48:05,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.85714285714286) internal successors, (790), 7 states have internal predecessors, (790), 0 states have call successors, (0), 0 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:05,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:48:05,530 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] [2023-09-01 09:48:05,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:48:05,530 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-09-01 09:48:05,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:48:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1671840729, now seen corresponding path program 1 times [2023-09-01 09:48:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:48:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663924953] [2023-09-01 09:48:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:48:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:48:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:48:05,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:48:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:48:05,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:48:05,650 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:48:05,651 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-09-01 09:48:05,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-09-01 09:48:05,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-09-01 09:48:05,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-09-01 09:48:05,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-09-01 09:48:05,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-09-01 09:48:05,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-09-01 09:48:05,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:48:05,654 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:48:05,663 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:48:05,663 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:48:05,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:48:05 BasicIcfg [2023-09-01 09:48:05,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:48:05,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:48:05,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:48:05,766 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:48:05,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:47:38" (3/4) ... [2023-09-01 09:48:05,768 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:48:05,864 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:48:05,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:48:05,865 INFO L158 Benchmark]: Toolchain (without parser) took 28373.05ms. Allocated memory was 69.2MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 46.0MB in the beginning and 1.0GB in the end (delta: -975.4MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-09-01 09:48:05,865 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 69.2MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:48:05,865 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.59ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 45.8MB in the beginning and 64.1MB in the end (delta: -18.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-09-01 09:48:05,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.59ms. Allocated memory is still 94.4MB. Free memory was 64.1MB in the beginning and 61.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:48:05,866 INFO L158 Benchmark]: Boogie Preprocessor took 52.30ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:48:05,866 INFO L158 Benchmark]: RCFGBuilder took 696.16ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 54.9MB in the end (delta: 4.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-09-01 09:48:05,867 INFO L158 Benchmark]: TraceAbstraction took 26787.03ms. Allocated memory was 94.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 53.7MB in the beginning and 1.0GB in the end (delta: -983.4MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-09-01 09:48:05,867 INFO L158 Benchmark]: Witness Printer took 98.68ms. Allocated memory is still 2.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-09-01 09:48:05,870 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 69.2MB. Free memory is still 46.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 652.59ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 45.8MB in the beginning and 64.1MB in the end (delta: -18.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.59ms. Allocated memory is still 94.4MB. Free memory was 64.1MB in the beginning and 61.3MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.30ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 59.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 696.16ms. Allocated memory is still 94.4MB. Free memory was 59.2MB in the beginning and 54.9MB in the end (delta: 4.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 26787.03ms. Allocated memory was 94.4MB in the beginning and 2.6GB in the end (delta: 2.5GB). Free memory was 53.7MB in the beginning and 1.0GB in the end (delta: -983.4MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 98.68ms. Allocated memory is still 2.6GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 137 PlacesBefore, 42 PlacesAfterwards, 126 TransitionsBefore, 29 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 7767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3176, independent: 2954, independent conditional: 0, independent unconditional: 2954, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1542, independent: 1507, independent conditional: 0, independent unconditional: 1507, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3176, independent: 1447, independent conditional: 0, independent unconditional: 1447, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 1542, unknown conditional: 0, unknown unconditional: 1542] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=0, t685={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=1, t685={6:0}, t686={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=2, t685={6:0}, t686={7:0}, t687={8:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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(&t688, ((void *)0), P3, ((void *)0))=3, t685={6:0}, t686={7:0}, t687={8:0}, t688={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, t685={6:0}, t686={7:0}, t687={8:0}, t688={5:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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: 26.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 669 mSDsluCounter, 292 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1854 IncrementalHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 66 mSDtfsCounter, 1854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1279occurred in iteration=12, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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:48:05,903 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