./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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 ../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:42:28,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:42:28,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:42:28,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:42:28,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:42:28,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:42:28,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:42:28,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:42:28,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:42:28,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:42:28,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:42:28,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:42:28,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:42:28,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:42:28,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:42:28,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:42:28,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:42:28,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:42:28,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:42:28,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:42:28,397 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:42:28,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:42:28,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:42:28,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:42:28,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:42:28,410 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:42:28,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:42:28,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:42:28,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:42:28,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:42:28,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:42:28,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:42:28,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:42:28,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:42:28,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:42:28,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:42:28,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:42:28,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:42:28,419 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:42:28,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:42:28,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:42:28,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:42:28,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:42:28,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:42:28,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:42:28,463 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:42:28,463 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:42:28,464 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:42:28,464 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:42:28,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:42:28,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:42:28,465 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:42:28,466 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:42:28,466 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:42:28,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:42:28,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:42:28,467 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:42:28,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:42:28,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:42:28,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:42:28,479 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:42:28,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:42:28,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:42:28,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:42:28,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:42:28,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:42:28,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:42:28,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:42:28,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:42:28,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:42:28,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:42:28,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:42:28,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:42:28,482 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:42:28,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:42:28,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:42:28,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2022-07-21 08:42:28,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:42:28,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:42:28,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:42:28,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:42:28,870 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:42:28,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2022-07-21 08:42:28,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54fd79f96/63cf48317c29404a81237e38589a72e5/FLAG989b695cb [2022-07-21 08:42:29,402 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:42:29,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2022-07-21 08:42:29,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54fd79f96/63cf48317c29404a81237e38589a72e5/FLAG989b695cb [2022-07-21 08:42:29,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54fd79f96/63cf48317c29404a81237e38589a72e5 [2022-07-21 08:42:29,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:42:29,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:42:29,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:42:29,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:42:29,781 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:42:29,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:42:29" (1/1) ... [2022-07-21 08:42:29,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9f9bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:29, skipping insertion in model container [2022-07-21 08:42:29,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:42:29" (1/1) ... [2022-07-21 08:42:29,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:42:29,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:42:30,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-07-21 08:42:30,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:42:30,217 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:42:30,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-07-21 08:42:30,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:42:30,333 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:42:30,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30 WrapperNode [2022-07-21 08:42:30,334 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:42:30,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:42:30,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:42:30,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:42:30,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,403 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 290 [2022-07-21 08:42:30,403 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:42:30,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:42:30,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:42:30,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:42:30,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:42:30,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:42:30,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:42:30,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:42:30,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (1/1) ... [2022-07-21 08:42:30,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:42:30,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:42:30,501 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) [2022-07-21 08:42:30,529 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 [2022-07-21 08:42:30,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 08:42:30,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-21 08:42:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:42:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 08:42:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 08:42:30,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-21 08:42:30,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-21 08:42:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-21 08:42:30,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-21 08:42:30,546 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-21 08:42:30,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-21 08:42:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-21 08:42:30,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-21 08:42:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:42:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-21 08:42:30,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:42:30,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:42:30,549 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 08:42:30,734 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:42:30,736 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:42:31,342 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:42:31,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:42:31,664 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 08:42:31,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:42:31 BoogieIcfgContainer [2022-07-21 08:42:31,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:42:31,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:42:31,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:42:31,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:42:31,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:42:29" (1/3) ... [2022-07-21 08:42:31,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5a8b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:42:31, skipping insertion in model container [2022-07-21 08:42:31,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:42:30" (2/3) ... [2022-07-21 08:42:31,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5a8b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:42:31, skipping insertion in model container [2022-07-21 08:42:31,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:42:31" (3/3) ... [2022-07-21 08:42:31,674 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-07-21 08:42:31,679 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 08:42:31,688 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:42:31,688 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:42:31,688 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 08:42:31,743 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-21 08:42:31,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-07-21 08:42:31,821 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2022-07-21 08:42:31,822 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:42:31,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-07-21 08:42:31,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-07-21 08:42:31,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-07-21 08:42:31,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:42:31,844 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c6e0d75, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@400f634c [2022-07-21 08:42:31,844 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-21 08:42:31,857 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2022-07-21 08:42:31,858 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-21 08:42:31,858 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:31,858 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:31,859 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:31,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1118078414, now seen corresponding path program 1 times [2022-07-21 08:42:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:31,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572188015] [2022-07-21 08:42:31,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:32,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:32,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572188015] [2022-07-21 08:42:32,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572188015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:32,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:32,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 08:42:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377207797] [2022-07-21 08:42:32,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:32,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:42:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:32,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:42:32,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 08:42:32,252 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 134 [2022-07-21 08:42:32,259 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:32,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:32,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 134 [2022-07-21 08:42:32,260 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:32,483 INFO L129 PetriNetUnfolder]: 57/522 cut-off events. [2022-07-21 08:42:32,484 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-21 08:42:32,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 522 events. 57/522 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2646 event pairs, 31 based on Foata normal form. 15/507 useless extension candidates. Maximal degree in co-relation 595. Up to 75 conditions per place. [2022-07-21 08:42:32,495 INFO L132 encePairwiseOnDemand]: 129/134 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2022-07-21 08:42:32,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 131 transitions, 309 flow [2022-07-21 08:42:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:42:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 08:42:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2022-07-21 08:42:32,519 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2022-07-21 08:42:32,520 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2022-07-21 08:42:32,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2022-07-21 08:42:32,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:32,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2022-07-21 08:42:32,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:32,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:32,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:32,536 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 3 states and 378 transitions. [2022-07-21 08:42:32,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 131 transitions, 309 flow [2022-07-21 08:42:32,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-21 08:42:32,543 INFO L242 Difference]: Finished difference. Result has 137 places, 126 transitions, 264 flow [2022-07-21 08:42:32,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2022-07-21 08:42:32,548 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, -4 predicate places. [2022-07-21 08:42:32,548 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 264 flow [2022-07-21 08:42:32,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:32,549 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:32,549 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:32,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:42:32,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:32,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:32,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1709840169, now seen corresponding path program 1 times [2022-07-21 08:42:32,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:32,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035222368] [2022-07-21 08:42:32,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:32,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:32,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035222368] [2022-07-21 08:42:32,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035222368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:32,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:32,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:42:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093027472] [2022-07-21 08:42:32,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:32,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:42:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:42:32,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:42:32,847 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2022-07-21 08:42:32,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 264 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) [2022-07-21 08:42:32,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:32,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2022-07-21 08:42:32,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:33,463 INFO L129 PetriNetUnfolder]: 954/2701 cut-off events. [2022-07-21 08:42:33,463 INFO L130 PetriNetUnfolder]: For 150/150 co-relation queries the response was YES. [2022-07-21 08:42:33,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4323 conditions, 2701 events. 954/2701 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 21842 event pairs, 125 based on Foata normal form. 0/2632 useless extension candidates. Maximal degree in co-relation 4268. Up to 816 conditions per place. [2022-07-21 08:42:33,495 INFO L132 encePairwiseOnDemand]: 127/134 looper letters, 24 selfloop transitions, 3 changer transitions 56/177 dead transitions. [2022-07-21 08:42:33,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 177 transitions, 526 flow [2022-07-21 08:42:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:42:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:42:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1071 transitions. [2022-07-21 08:42:33,499 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8880597014925373 [2022-07-21 08:42:33,499 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1071 transitions. [2022-07-21 08:42:33,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1071 transitions. [2022-07-21 08:42:33,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:33,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1071 transitions. [2022-07-21 08:42:33,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:33,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:33,508 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:33,508 INFO L186 Difference]: Start difference. First operand has 137 places, 126 transitions, 264 flow. Second operand 9 states and 1071 transitions. [2022-07-21 08:42:33,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 177 transitions, 526 flow [2022-07-21 08:42:33,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 177 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 08:42:33,513 INFO L242 Difference]: Finished difference. Result has 150 places, 114 transitions, 275 flow [2022-07-21 08:42:33,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=150, PETRI_TRANSITIONS=114} [2022-07-21 08:42:33,514 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 9 predicate places. [2022-07-21 08:42:33,514 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 114 transitions, 275 flow [2022-07-21 08:42:33,515 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) [2022-07-21 08:42:33,515 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:33,515 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:33,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:42:33,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:33,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1673744296, now seen corresponding path program 1 times [2022-07-21 08:42:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:33,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221050408] [2022-07-21 08:42:33,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:33,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:33,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221050408] [2022-07-21 08:42:33,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221050408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:33,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:33,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 08:42:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330988997] [2022-07-21 08:42:33,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:33,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 08:42:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:33,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 08:42:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:42:33,814 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:33,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 114 transitions, 275 flow. Second operand has 11 states, 11 states have (on average 109.45454545454545) internal successors, (1204), 11 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:33,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:33,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:33,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:34,549 INFO L129 PetriNetUnfolder]: 755/1541 cut-off events. [2022-07-21 08:42:34,550 INFO L130 PetriNetUnfolder]: For 1274/1284 co-relation queries the response was YES. [2022-07-21 08:42:34,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3602 conditions, 1541 events. 755/1541 cut-off events. For 1274/1284 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10089 event pairs, 195 based on Foata normal form. 45/1517 useless extension candidates. Maximal degree in co-relation 3536. Up to 603 conditions per place. [2022-07-21 08:42:34,566 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 22 selfloop transitions, 10 changer transitions 44/169 dead transitions. [2022-07-21 08:42:34,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 169 transitions, 571 flow [2022-07-21 08:42:34,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:42:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-21 08:42:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1915 transitions. [2022-07-21 08:42:34,571 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.840649692712906 [2022-07-21 08:42:34,571 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1915 transitions. [2022-07-21 08:42:34,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1915 transitions. [2022-07-21 08:42:34,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:34,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1915 transitions. [2022-07-21 08:42:34,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 112.6470588235294) internal successors, (1915), 17 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:34,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 134.0) internal successors, (2412), 18 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:34,581 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 134.0) internal successors, (2412), 18 states have internal predecessors, (2412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:34,581 INFO L186 Difference]: Start difference. First operand has 150 places, 114 transitions, 275 flow. Second operand 17 states and 1915 transitions. [2022-07-21 08:42:34,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 169 transitions, 571 flow [2022-07-21 08:42:34,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 169 transitions, 550 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-21 08:42:34,591 INFO L242 Difference]: Finished difference. Result has 153 places, 119 transitions, 351 flow [2022-07-21 08:42:34,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=351, PETRI_PLACES=153, PETRI_TRANSITIONS=119} [2022-07-21 08:42:34,592 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 12 predicate places. [2022-07-21 08:42:34,592 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 119 transitions, 351 flow [2022-07-21 08:42:34,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.45454545454545) internal successors, (1204), 11 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:34,593 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:34,593 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:34,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:42:34,593 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:34,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:34,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1604978853, now seen corresponding path program 1 times [2022-07-21 08:42:34,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:34,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779041430] [2022-07-21 08:42:34,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:34,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779041430] [2022-07-21 08:42:34,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779041430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:34,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:34,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:42:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596277960] [2022-07-21 08:42:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:34,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:42:34,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:34,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:42:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:42:34,845 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2022-07-21 08:42:34,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 119 transitions, 351 flow. Second operand has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:34,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:34,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2022-07-21 08:42:34,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:35,463 INFO L129 PetriNetUnfolder]: 617/1425 cut-off events. [2022-07-21 08:42:35,463 INFO L130 PetriNetUnfolder]: For 4554/4560 co-relation queries the response was YES. [2022-07-21 08:42:35,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4985 conditions, 1425 events. 617/1425 cut-off events. For 4554/4560 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9352 event pairs, 67 based on Foata normal form. 29/1402 useless extension candidates. Maximal degree in co-relation 4908. Up to 488 conditions per place. [2022-07-21 08:42:35,483 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 30 selfloop transitions, 9 changer transitions 37/171 dead transitions. [2022-07-21 08:42:35,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 171 transitions, 865 flow [2022-07-21 08:42:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:35,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1615 transitions. [2022-07-21 08:42:35,488 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8608742004264393 [2022-07-21 08:42:35,488 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1615 transitions. [2022-07-21 08:42:35,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1615 transitions. [2022-07-21 08:42:35,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:35,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1615 transitions. [2022-07-21 08:42:35,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.35714285714286) internal successors, (1615), 14 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:35,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:35,496 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:35,497 INFO L186 Difference]: Start difference. First operand has 153 places, 119 transitions, 351 flow. Second operand 14 states and 1615 transitions. [2022-07-21 08:42:35,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 171 transitions, 865 flow [2022-07-21 08:42:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 171 transitions, 833 flow, removed 12 selfloop flow, removed 7 redundant places. [2022-07-21 08:42:35,506 INFO L242 Difference]: Finished difference. Result has 160 places, 123 transitions, 422 flow [2022-07-21 08:42:35,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=422, PETRI_PLACES=160, PETRI_TRANSITIONS=123} [2022-07-21 08:42:35,508 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 19 predicate places. [2022-07-21 08:42:35,508 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 123 transitions, 422 flow [2022-07-21 08:42:35,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.66666666666667) internal successors, (1005), 9 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:35,509 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:35,509 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:35,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:42:35,509 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1674018137, now seen corresponding path program 2 times [2022-07-21 08:42:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:35,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800203254] [2022-07-21 08:42:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800203254] [2022-07-21 08:42:35,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800203254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:35,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:35,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:42:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833901053] [2022-07-21 08:42:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:35,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:42:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:42:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:42:35,782 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-21 08:42:35,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 123 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:35,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:35,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-21 08:42:35,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:36,391 INFO L129 PetriNetUnfolder]: 605/1431 cut-off events. [2022-07-21 08:42:36,391 INFO L130 PetriNetUnfolder]: For 9939/10012 co-relation queries the response was YES. [2022-07-21 08:42:36,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6519 conditions, 1431 events. 605/1431 cut-off events. For 9939/10012 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9200 event pairs, 128 based on Foata normal form. 39/1405 useless extension candidates. Maximal degree in co-relation 6435. Up to 480 conditions per place. [2022-07-21 08:42:36,416 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 31 selfloop transitions, 12 changer transitions 37/174 dead transitions. [2022-07-21 08:42:36,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 174 transitions, 1174 flow [2022-07-21 08:42:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:42:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:42:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1711 transitions. [2022-07-21 08:42:36,421 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8512437810945274 [2022-07-21 08:42:36,421 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1711 transitions. [2022-07-21 08:42:36,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1711 transitions. [2022-07-21 08:42:36,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:36,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1711 transitions. [2022-07-21 08:42:36,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.06666666666666) internal successors, (1711), 15 states have internal predecessors, (1711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:36,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:36,430 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:36,430 INFO L186 Difference]: Start difference. First operand has 160 places, 123 transitions, 422 flow. Second operand 15 states and 1711 transitions. [2022-07-21 08:42:36,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 174 transitions, 1174 flow [2022-07-21 08:42:36,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 174 transitions, 1097 flow, removed 32 selfloop flow, removed 8 redundant places. [2022-07-21 08:42:36,446 INFO L242 Difference]: Finished difference. Result has 167 places, 126 transitions, 494 flow [2022-07-21 08:42:36,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=494, PETRI_PLACES=167, PETRI_TRANSITIONS=126} [2022-07-21 08:42:36,447 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 26 predicate places. [2022-07-21 08:42:36,447 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 126 transitions, 494 flow [2022-07-21 08:42:36,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.6) internal successors, (1106), 10 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:36,448 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:36,448 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:36,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:42:36,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:36,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:36,449 INFO L85 PathProgramCache]: Analyzing trace with hash 627962931, now seen corresponding path program 1 times [2022-07-21 08:42:36,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:36,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087586565] [2022-07-21 08:42:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:36,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087586565] [2022-07-21 08:42:36,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087586565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:36,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:36,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 08:42:36,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961507329] [2022-07-21 08:42:36,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:36,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 08:42:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:36,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 08:42:36,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-07-21 08:42:36,786 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2022-07-21 08:42:36,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 126 transitions, 494 flow. Second operand has 14 states, 14 states have (on average 107.42857142857143) internal successors, (1504), 14 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:36,788 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:36,788 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2022-07-21 08:42:36,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:37,382 INFO L129 PetriNetUnfolder]: 466/1144 cut-off events. [2022-07-21 08:42:37,382 INFO L130 PetriNetUnfolder]: For 12987/13128 co-relation queries the response was YES. [2022-07-21 08:42:37,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5965 conditions, 1144 events. 466/1144 cut-off events. For 12987/13128 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7087 event pairs, 132 based on Foata normal form. 24/1104 useless extension candidates. Maximal degree in co-relation 5872. Up to 450 conditions per place. [2022-07-21 08:42:37,406 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 32 selfloop transitions, 11 changer transitions 25/159 dead transitions. [2022-07-21 08:42:37,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 159 transitions, 1133 flow [2022-07-21 08:42:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:42:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:42:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1650 transitions. [2022-07-21 08:42:37,411 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8208955223880597 [2022-07-21 08:42:37,411 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1650 transitions. [2022-07-21 08:42:37,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1650 transitions. [2022-07-21 08:42:37,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:37,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1650 transitions. [2022-07-21 08:42:37,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 110.0) internal successors, (1650), 15 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:37,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:37,419 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:37,420 INFO L186 Difference]: Start difference. First operand has 167 places, 126 transitions, 494 flow. Second operand 15 states and 1650 transitions. [2022-07-21 08:42:37,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 159 transitions, 1133 flow [2022-07-21 08:42:37,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 159 transitions, 941 flow, removed 90 selfloop flow, removed 12 redundant places. [2022-07-21 08:42:37,437 INFO L242 Difference]: Finished difference. Result has 167 places, 126 transitions, 465 flow [2022-07-21 08:42:37,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=465, PETRI_PLACES=167, PETRI_TRANSITIONS=126} [2022-07-21 08:42:37,438 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 26 predicate places. [2022-07-21 08:42:37,439 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 126 transitions, 465 flow [2022-07-21 08:42:37,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 107.42857142857143) internal successors, (1504), 14 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:37,440 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:37,440 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:37,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:42:37,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:37,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash -849401043, now seen corresponding path program 1 times [2022-07-21 08:42:37,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:37,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390396377] [2022-07-21 08:42:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:37,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:37,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:37,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390396377] [2022-07-21 08:42:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390396377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:37,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:37,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:42:37,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132063147] [2022-07-21 08:42:37,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:37,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:42:37,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:37,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:42:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:42:37,683 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-21 08:42:37,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 126 transitions, 465 flow. Second operand has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:37,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:37,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-21 08:42:37,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:38,181 INFO L129 PetriNetUnfolder]: 499/1239 cut-off events. [2022-07-21 08:42:38,182 INFO L130 PetriNetUnfolder]: For 9266/9370 co-relation queries the response was YES. [2022-07-21 08:42:38,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5660 conditions, 1239 events. 499/1239 cut-off events. For 9266/9370 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7691 event pairs, 100 based on Foata normal form. 46/1222 useless extension candidates. Maximal degree in co-relation 5568. Up to 464 conditions per place. [2022-07-21 08:42:38,205 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 30 selfloop transitions, 13 changer transitions 25/162 dead transitions. [2022-07-21 08:42:38,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 162 transitions, 1025 flow [2022-07-21 08:42:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:42:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-21 08:42:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1371 transitions. [2022-07-21 08:42:38,209 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8526119402985075 [2022-07-21 08:42:38,209 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1371 transitions. [2022-07-21 08:42:38,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1371 transitions. [2022-07-21 08:42:38,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:38,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1371 transitions. [2022-07-21 08:42:38,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 114.25) internal successors, (1371), 12 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:38,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:38,217 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 134.0) internal successors, (1742), 13 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:38,217 INFO L186 Difference]: Start difference. First operand has 167 places, 126 transitions, 465 flow. Second operand 12 states and 1371 transitions. [2022-07-21 08:42:38,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 162 transitions, 1025 flow [2022-07-21 08:42:38,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 162 transitions, 959 flow, removed 24 selfloop flow, removed 16 redundant places. [2022-07-21 08:42:38,230 INFO L242 Difference]: Finished difference. Result has 163 places, 129 transitions, 533 flow [2022-07-21 08:42:38,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=533, PETRI_PLACES=163, PETRI_TRANSITIONS=129} [2022-07-21 08:42:38,232 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 22 predicate places. [2022-07-21 08:42:38,232 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 129 transitions, 533 flow [2022-07-21 08:42:38,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:38,233 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:38,233 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:38,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:42:38,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:38,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1134362339, now seen corresponding path program 2 times [2022-07-21 08:42:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:38,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177721892] [2022-07-21 08:42:38,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:38,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:38,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:38,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177721892] [2022-07-21 08:42:38,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177721892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:38,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:38,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 08:42:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887348675] [2022-07-21 08:42:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:38,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 08:42:38,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 08:42:38,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:42:38,447 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:38,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 129 transitions, 533 flow. Second operand has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:38,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:38,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:38,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:39,108 INFO L129 PetriNetUnfolder]: 505/1257 cut-off events. [2022-07-21 08:42:39,108 INFO L130 PetriNetUnfolder]: For 16284/16416 co-relation queries the response was YES. [2022-07-21 08:42:39,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7029 conditions, 1257 events. 505/1257 cut-off events. For 16284/16416 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7873 event pairs, 98 based on Foata normal form. 50/1244 useless extension candidates. Maximal degree in co-relation 6942. Up to 470 conditions per place. [2022-07-21 08:42:39,134 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 29 selfloop transitions, 18 changer transitions 25/165 dead transitions. [2022-07-21 08:42:39,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 165 transitions, 1279 flow [2022-07-21 08:42:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:42:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:42:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1468 transitions. [2022-07-21 08:42:39,138 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8427095292766934 [2022-07-21 08:42:39,138 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1468 transitions. [2022-07-21 08:42:39,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1468 transitions. [2022-07-21 08:42:39,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:39,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1468 transitions. [2022-07-21 08:42:39,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.92307692307692) internal successors, (1468), 13 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:39,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:39,146 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:39,146 INFO L186 Difference]: Start difference. First operand has 163 places, 129 transitions, 533 flow. Second operand 13 states and 1468 transitions. [2022-07-21 08:42:39,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 165 transitions, 1279 flow [2022-07-21 08:42:39,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 165 transitions, 1211 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-07-21 08:42:39,160 INFO L242 Difference]: Finished difference. Result has 169 places, 132 transitions, 621 flow [2022-07-21 08:42:39,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=621, PETRI_PLACES=169, PETRI_TRANSITIONS=132} [2022-07-21 08:42:39,161 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 28 predicate places. [2022-07-21 08:42:39,161 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 132 transitions, 621 flow [2022-07-21 08:42:39,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.63636363636364) internal successors, (1206), 11 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:39,162 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:39,162 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:39,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:42:39,163 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 648679459, now seen corresponding path program 3 times [2022-07-21 08:42:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103299769] [2022-07-21 08:42:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:39,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:39,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103299769] [2022-07-21 08:42:39,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103299769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:39,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:39,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:42:39,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726714489] [2022-07-21 08:42:39,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:39,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:42:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:39,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:42:39,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:42:39,332 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 134 [2022-07-21 08:42:39,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 132 transitions, 621 flow. Second operand has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:39,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:39,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 134 [2022-07-21 08:42:39,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:39,964 INFO L129 PetriNetUnfolder]: 601/1497 cut-off events. [2022-07-21 08:42:39,964 INFO L130 PetriNetUnfolder]: For 37747/37948 co-relation queries the response was YES. [2022-07-21 08:42:39,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10501 conditions, 1497 events. 601/1497 cut-off events. For 37747/37948 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9747 event pairs, 44 based on Foata normal form. 46/1474 useless extension candidates. Maximal degree in co-relation 10410. Up to 498 conditions per place. [2022-07-21 08:42:39,998 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 36 selfloop transitions, 19 changer transitions 25/174 dead transitions. [2022-07-21 08:42:39,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 174 transitions, 1661 flow [2022-07-21 08:42:39,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1592 transitions. [2022-07-21 08:42:40,003 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8486140724946695 [2022-07-21 08:42:40,003 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1592 transitions. [2022-07-21 08:42:40,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1592 transitions. [2022-07-21 08:42:40,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:40,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1592 transitions. [2022-07-21 08:42:40,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.71428571428571) internal successors, (1592), 14 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,011 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,011 INFO L186 Difference]: Start difference. First operand has 169 places, 132 transitions, 621 flow. Second operand 14 states and 1592 transitions. [2022-07-21 08:42:40,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 174 transitions, 1661 flow [2022-07-21 08:42:40,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 174 transitions, 1061 flow, removed 286 selfloop flow, removed 17 redundant places. [2022-07-21 08:42:40,038 INFO L242 Difference]: Finished difference. Result has 166 places, 135 transitions, 601 flow [2022-07-21 08:42:40,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=601, PETRI_PLACES=166, PETRI_TRANSITIONS=135} [2022-07-21 08:42:40,039 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 25 predicate places. [2022-07-21 08:42:40,039 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 135 transitions, 601 flow [2022-07-21 08:42:40,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,040 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:40,040 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:40,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:42:40,041 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:40,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1019288933, now seen corresponding path program 1 times [2022-07-21 08:42:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:40,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241590596] [2022-07-21 08:42:40,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:40,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:40,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241590596] [2022-07-21 08:42:40,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241590596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:40,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:40,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:42:40,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612125368] [2022-07-21 08:42:40,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:40,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:42:40,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:42:40,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:42:40,325 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 134 [2022-07-21 08:42:40,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 135 transitions, 601 flow. Second operand has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:40,328 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 134 [2022-07-21 08:42:40,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:40,849 INFO L129 PetriNetUnfolder]: 485/1289 cut-off events. [2022-07-21 08:42:40,850 INFO L130 PetriNetUnfolder]: For 13062/13312 co-relation queries the response was YES. [2022-07-21 08:42:40,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6672 conditions, 1289 events. 485/1289 cut-off events. For 13062/13312 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8277 event pairs, 90 based on Foata normal form. 48/1262 useless extension candidates. Maximal degree in co-relation 6583. Up to 562 conditions per place. [2022-07-21 08:42:40,875 INFO L132 encePairwiseOnDemand]: 120/134 looper letters, 38 selfloop transitions, 16 changer transitions 19/164 dead transitions. [2022-07-21 08:42:40,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 164 transitions, 1187 flow [2022-07-21 08:42:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1544 transitions. [2022-07-21 08:42:40,878 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8230277185501066 [2022-07-21 08:42:40,879 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1544 transitions. [2022-07-21 08:42:40,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1544 transitions. [2022-07-21 08:42:40,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:40,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1544 transitions. [2022-07-21 08:42:40,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 110.28571428571429) internal successors, (1544), 14 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,887 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,887 INFO L186 Difference]: Start difference. First operand has 166 places, 135 transitions, 601 flow. Second operand 14 states and 1544 transitions. [2022-07-21 08:42:40,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 164 transitions, 1187 flow [2022-07-21 08:42:40,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 164 transitions, 983 flow, removed 96 selfloop flow, removed 11 redundant places. [2022-07-21 08:42:40,905 INFO L242 Difference]: Finished difference. Result has 169 places, 137 transitions, 638 flow [2022-07-21 08:42:40,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=638, PETRI_PLACES=169, PETRI_TRANSITIONS=137} [2022-07-21 08:42:40,906 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 28 predicate places. [2022-07-21 08:42:40,906 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 137 transitions, 638 flow [2022-07-21 08:42:40,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:40,908 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:40,908 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:40,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:42:40,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:40,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1964833303, now seen corresponding path program 2 times [2022-07-21 08:42:40,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:40,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364818849] [2022-07-21 08:42:40,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:40,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:41,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:41,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:41,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364818849] [2022-07-21 08:42:41,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364818849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:41,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:41,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 08:42:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163350720] [2022-07-21 08:42:41,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:41,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 08:42:41,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 08:42:41,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-21 08:42:41,191 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 134 [2022-07-21 08:42:41,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 137 transitions, 638 flow. Second operand has 13 states, 13 states have (on average 108.53846153846153) internal successors, (1411), 13 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:41,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:41,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 134 [2022-07-21 08:42:41,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:41,878 INFO L129 PetriNetUnfolder]: 487/1337 cut-off events. [2022-07-21 08:42:41,878 INFO L130 PetriNetUnfolder]: For 11576/11699 co-relation queries the response was YES. [2022-07-21 08:42:41,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 1337 events. 487/1337 cut-off events. For 11576/11699 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8826 event pairs, 54 based on Foata normal form. 32/1301 useless extension candidates. Maximal degree in co-relation 6472. Up to 480 conditions per place. [2022-07-21 08:42:41,900 INFO L132 encePairwiseOnDemand]: 121/134 looper letters, 36 selfloop transitions, 28 changer transitions 19/175 dead transitions. [2022-07-21 08:42:41,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 175 transitions, 1319 flow [2022-07-21 08:42:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:42:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:42:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1673 transitions. [2022-07-21 08:42:41,903 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8323383084577114 [2022-07-21 08:42:41,903 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1673 transitions. [2022-07-21 08:42:41,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1673 transitions. [2022-07-21 08:42:41,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:41,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1673 transitions. [2022-07-21 08:42:41,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 111.53333333333333) internal successors, (1673), 15 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:41,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:41,910 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:41,911 INFO L186 Difference]: Start difference. First operand has 169 places, 137 transitions, 638 flow. Second operand 15 states and 1673 transitions. [2022-07-21 08:42:41,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 175 transitions, 1319 flow [2022-07-21 08:42:41,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 1132 flow, removed 80 selfloop flow, removed 12 redundant places. [2022-07-21 08:42:41,929 INFO L242 Difference]: Finished difference. Result has 172 places, 142 transitions, 747 flow [2022-07-21 08:42:41,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=747, PETRI_PLACES=172, PETRI_TRANSITIONS=142} [2022-07-21 08:42:41,930 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 31 predicate places. [2022-07-21 08:42:41,930 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 142 transitions, 747 flow [2022-07-21 08:42:41,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.53846153846153) internal successors, (1411), 13 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:41,931 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:41,931 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:41,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:42:41,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:41,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:41,932 INFO L85 PathProgramCache]: Analyzing trace with hash 891796649, now seen corresponding path program 3 times [2022-07-21 08:42:41,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:41,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125757560] [2022-07-21 08:42:41,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:41,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:42,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:42,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125757560] [2022-07-21 08:42:42,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125757560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:42,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:42,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:42:42,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921263719] [2022-07-21 08:42:42,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:42,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:42:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:42:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:42:42,159 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:42,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 142 transitions, 747 flow. Second operand has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:42,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:42,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:42,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:42,670 INFO L129 PetriNetUnfolder]: 511/1465 cut-off events. [2022-07-21 08:42:42,670 INFO L130 PetriNetUnfolder]: For 14648/15047 co-relation queries the response was YES. [2022-07-21 08:42:42,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7533 conditions, 1465 events. 511/1465 cut-off events. For 14648/15047 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10330 event pairs, 90 based on Foata normal form. 55/1450 useless extension candidates. Maximal degree in co-relation 7443. Up to 416 conditions per place. [2022-07-21 08:42:42,689 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 40 selfloop transitions, 25 changer transitions 19/177 dead transitions. [2022-07-21 08:42:42,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 177 transitions, 1441 flow [2022-07-21 08:42:42,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:42:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-21 08:42:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1681 transitions. [2022-07-21 08:42:42,692 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.836318407960199 [2022-07-21 08:42:42,693 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1681 transitions. [2022-07-21 08:42:42,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1681 transitions. [2022-07-21 08:42:42,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:42,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1681 transitions. [2022-07-21 08:42:42,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 112.06666666666666) internal successors, (1681), 15 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:42,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:42,703 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 134.0) internal successors, (2144), 16 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:42,703 INFO L186 Difference]: Start difference. First operand has 172 places, 142 transitions, 747 flow. Second operand 15 states and 1681 transitions. [2022-07-21 08:42:42,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 177 transitions, 1441 flow [2022-07-21 08:42:42,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 177 transitions, 1253 flow, removed 80 selfloop flow, removed 12 redundant places. [2022-07-21 08:42:42,728 INFO L242 Difference]: Finished difference. Result has 175 places, 144 transitions, 818 flow [2022-07-21 08:42:42,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=818, PETRI_PLACES=175, PETRI_TRANSITIONS=144} [2022-07-21 08:42:42,729 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 34 predicate places. [2022-07-21 08:42:42,729 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 144 transitions, 818 flow [2022-07-21 08:42:42,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.58333333333333) internal successors, (1315), 12 states have internal predecessors, (1315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:42,730 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:42,730 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:42,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:42:42,731 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:42,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1723123753, now seen corresponding path program 1 times [2022-07-21 08:42:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:42,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615366151] [2022-07-21 08:42:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:42,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615366151] [2022-07-21 08:42:42,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615366151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:42,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:42,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:42:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743483160] [2022-07-21 08:42:42,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:42,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:42:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:42:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:42:42,834 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:42,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 144 transitions, 818 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:42,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:42,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:42,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:44,722 INFO L129 PetriNetUnfolder]: 6946/12268 cut-off events. [2022-07-21 08:42:44,722 INFO L130 PetriNetUnfolder]: For 138857/140746 co-relation queries the response was YES. [2022-07-21 08:42:44,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57255 conditions, 12268 events. 6946/12268 cut-off events. For 138857/140746 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 99004 event pairs, 655 based on Foata normal form. 1086/12879 useless extension candidates. Maximal degree in co-relation 57167. Up to 4289 conditions per place. [2022-07-21 08:42:44,896 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 221 selfloop transitions, 18 changer transitions 12/345 dead transitions. [2022-07-21 08:42:44,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 345 transitions, 3891 flow [2022-07-21 08:42:44,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:42:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-21 08:42:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1172 transitions. [2022-07-21 08:42:44,899 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8746268656716418 [2022-07-21 08:42:44,900 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1172 transitions. [2022-07-21 08:42:44,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1172 transitions. [2022-07-21 08:42:44,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:44,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1172 transitions. [2022-07-21 08:42:44,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.2) internal successors, (1172), 10 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,905 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 134.0) internal successors, (1474), 11 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:44,905 INFO L186 Difference]: Start difference. First operand has 175 places, 144 transitions, 818 flow. Second operand 10 states and 1172 transitions. [2022-07-21 08:42:44,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 345 transitions, 3891 flow [2022-07-21 08:42:45,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 345 transitions, 3467 flow, removed 112 selfloop flow, removed 14 redundant places. [2022-07-21 08:42:45,048 INFO L242 Difference]: Finished difference. Result has 170 places, 160 transitions, 862 flow [2022-07-21 08:42:45,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=862, PETRI_PLACES=170, PETRI_TRANSITIONS=160} [2022-07-21 08:42:45,050 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 29 predicate places. [2022-07-21 08:42:45,050 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 160 transitions, 862 flow [2022-07-21 08:42:45,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,050 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:45,050 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:45,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:42:45,051 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1601239142, now seen corresponding path program 1 times [2022-07-21 08:42:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:45,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822291639] [2022-07-21 08:42:45,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:45,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:45,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822291639] [2022-07-21 08:42:45,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822291639] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:45,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:45,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:42:45,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577106222] [2022-07-21 08:42:45,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:42:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:45,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:42:45,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:42:45,160 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:45,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 160 transitions, 862 flow. Second operand has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:45,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:45,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:45,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:47,135 INFO L129 PetriNetUnfolder]: 6430/12020 cut-off events. [2022-07-21 08:42:47,135 INFO L130 PetriNetUnfolder]: For 102965/104891 co-relation queries the response was YES. [2022-07-21 08:42:47,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58002 conditions, 12020 events. 6430/12020 cut-off events. For 102965/104891 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 104015 event pairs, 201 based on Foata normal form. 1316/13099 useless extension candidates. Maximal degree in co-relation 57917. Up to 3073 conditions per place. [2022-07-21 08:42:47,271 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 247 selfloop transitions, 36 changer transitions 42/419 dead transitions. [2022-07-21 08:42:47,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 419 transitions, 4703 flow [2022-07-21 08:42:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 08:42:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-21 08:42:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1525 transitions. [2022-07-21 08:42:47,275 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8754305396096441 [2022-07-21 08:42:47,275 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1525 transitions. [2022-07-21 08:42:47,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1525 transitions. [2022-07-21 08:42:47,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:47,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1525 transitions. [2022-07-21 08:42:47,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.3076923076923) internal successors, (1525), 13 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,282 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 134.0) internal successors, (1876), 14 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,283 INFO L186 Difference]: Start difference. First operand has 170 places, 160 transitions, 862 flow. Second operand 13 states and 1525 transitions. [2022-07-21 08:42:47,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 419 transitions, 4703 flow [2022-07-21 08:42:47,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 419 transitions, 4701 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 08:42:47,434 INFO L242 Difference]: Finished difference. Result has 187 places, 178 transitions, 1114 flow [2022-07-21 08:42:47,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1114, PETRI_PLACES=187, PETRI_TRANSITIONS=178} [2022-07-21 08:42:47,436 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 46 predicate places. [2022-07-21 08:42:47,436 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 178 transitions, 1114 flow [2022-07-21 08:42:47,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,436 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:47,437 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:47,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:42:47,437 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1259250527, now seen corresponding path program 1 times [2022-07-21 08:42:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:47,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718752361] [2022-07-21 08:42:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:47,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:47,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718752361] [2022-07-21 08:42:47,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718752361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:47,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:47,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:42:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261001233] [2022-07-21 08:42:47,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:47,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:42:47,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:47,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:42:47,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:42:47,549 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 134 [2022-07-21 08:42:47,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 178 transitions, 1114 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:47,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:47,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 134 [2022-07-21 08:42:47,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:48,863 INFO L129 PetriNetUnfolder]: 2244/7667 cut-off events. [2022-07-21 08:42:48,863 INFO L130 PetriNetUnfolder]: For 38799/45553 co-relation queries the response was YES. [2022-07-21 08:42:48,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30301 conditions, 7667 events. 2244/7667 cut-off events. For 38799/45553 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 91189 event pairs, 308 based on Foata normal form. 343/7428 useless extension candidates. Maximal degree in co-relation 30208. Up to 2145 conditions per place. [2022-07-21 08:42:48,936 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 67 selfloop transitions, 11 changer transitions 62/273 dead transitions. [2022-07-21 08:42:48,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 273 transitions, 2646 flow [2022-07-21 08:42:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 08:42:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-21 08:42:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1060 transitions. [2022-07-21 08:42:48,939 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.87893864013267 [2022-07-21 08:42:48,939 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1060 transitions. [2022-07-21 08:42:48,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1060 transitions. [2022-07-21 08:42:48,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:48,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1060 transitions. [2022-07-21 08:42:48,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.77777777777777) internal successors, (1060), 9 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,944 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 134.0) internal successors, (1340), 10 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:48,944 INFO L186 Difference]: Start difference. First operand has 187 places, 178 transitions, 1114 flow. Second operand 9 states and 1060 transitions. [2022-07-21 08:42:48,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 273 transitions, 2646 flow [2022-07-21 08:42:49,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 273 transitions, 2545 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-07-21 08:42:49,317 INFO L242 Difference]: Finished difference. Result has 198 places, 186 transitions, 1140 flow [2022-07-21 08:42:49,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1140, PETRI_PLACES=198, PETRI_TRANSITIONS=186} [2022-07-21 08:42:49,318 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 57 predicate places. [2022-07-21 08:42:49,318 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 186 transitions, 1140 flow [2022-07-21 08:42:49,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,319 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:49,319 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:49,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 08:42:49,319 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1614182972, now seen corresponding path program 1 times [2022-07-21 08:42:49,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:49,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54024293] [2022-07-21 08:42:49,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:49,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:49,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54024293] [2022-07-21 08:42:49,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54024293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:49,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:49,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:42:49,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854162523] [2022-07-21 08:42:49,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:49,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:42:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:42:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:42:49,441 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:49,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 186 transitions, 1140 flow. Second operand has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:49,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:49,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:49,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:52,449 INFO L129 PetriNetUnfolder]: 8832/16948 cut-off events. [2022-07-21 08:42:52,449 INFO L130 PetriNetUnfolder]: For 161513/164133 co-relation queries the response was YES. [2022-07-21 08:42:52,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85186 conditions, 16948 events. 8832/16948 cut-off events. For 161513/164133 co-relation queries the response was YES. Maximal size of possible extension queue 1366. Compared 163088 event pairs, 90 based on Foata normal form. 1975/18614 useless extension candidates. Maximal degree in co-relation 85087. Up to 4082 conditions per place. [2022-07-21 08:42:52,623 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 119 selfloop transitions, 25 changer transitions 216/454 dead transitions. [2022-07-21 08:42:52,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 454 transitions, 5317 flow [2022-07-21 08:42:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:42:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-21 08:42:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2022-07-21 08:42:52,628 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8759328358208955 [2022-07-21 08:42:52,628 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2022-07-21 08:42:52,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2022-07-21 08:42:52,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:52,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2022-07-21 08:42:52,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,639 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:52,640 INFO L186 Difference]: Start difference. First operand has 198 places, 186 transitions, 1140 flow. Second operand 16 states and 1878 transitions. [2022-07-21 08:42:52,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 454 transitions, 5317 flow [2022-07-21 08:42:53,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 454 transitions, 5023 flow, removed 62 selfloop flow, removed 7 redundant places. [2022-07-21 08:42:53,205 INFO L242 Difference]: Finished difference. Result has 213 places, 162 transitions, 1007 flow [2022-07-21 08:42:53,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1007, PETRI_PLACES=213, PETRI_TRANSITIONS=162} [2022-07-21 08:42:53,206 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 72 predicate places. [2022-07-21 08:42:53,206 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 162 transitions, 1007 flow [2022-07-21 08:42:53,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,206 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:53,206 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:53,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 08:42:53,207 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:53,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 26434292, now seen corresponding path program 1 times [2022-07-21 08:42:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:53,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933879918] [2022-07-21 08:42:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:53,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:53,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:53,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933879918] [2022-07-21 08:42:53,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933879918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:53,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:53,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:42:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094240110] [2022-07-21 08:42:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:53,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:42:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:42:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:42:53,328 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 134 [2022-07-21 08:42:53,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 162 transitions, 1007 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:53,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:53,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 134 [2022-07-21 08:42:53,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:55,278 INFO L129 PetriNetUnfolder]: 4297/9348 cut-off events. [2022-07-21 08:42:55,278 INFO L130 PetriNetUnfolder]: For 90380/91560 co-relation queries the response was YES. [2022-07-21 08:42:55,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48512 conditions, 9348 events. 4297/9348 cut-off events. For 90380/91560 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 93832 event pairs, 80 based on Foata normal form. 927/10085 useless extension candidates. Maximal degree in co-relation 48462. Up to 2484 conditions per place. [2022-07-21 08:42:55,338 INFO L132 encePairwiseOnDemand]: 124/134 looper letters, 101 selfloop transitions, 29 changer transitions 118/342 dead transitions. [2022-07-21 08:42:55,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 342 transitions, 3744 flow [2022-07-21 08:42:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 08:42:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-21 08:42:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1835 transitions. [2022-07-21 08:42:55,341 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8558768656716418 [2022-07-21 08:42:55,341 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1835 transitions. [2022-07-21 08:42:55,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1835 transitions. [2022-07-21 08:42:55,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:55,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1835 transitions. [2022-07-21 08:42:55,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.6875) internal successors, (1835), 16 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:55,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:55,348 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 134.0) internal successors, (2278), 17 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:55,348 INFO L186 Difference]: Start difference. First operand has 213 places, 162 transitions, 1007 flow. Second operand 16 states and 1835 transitions. [2022-07-21 08:42:55,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 342 transitions, 3744 flow [2022-07-21 08:42:55,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 342 transitions, 3195 flow, removed 247 selfloop flow, removed 22 redundant places. [2022-07-21 08:42:55,744 INFO L242 Difference]: Finished difference. Result has 197 places, 161 transitions, 883 flow [2022-07-21 08:42:55,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=883, PETRI_PLACES=197, PETRI_TRANSITIONS=161} [2022-07-21 08:42:55,745 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 56 predicate places. [2022-07-21 08:42:55,745 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 161 transitions, 883 flow [2022-07-21 08:42:55,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:55,745 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:55,745 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:55,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 08:42:55,746 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1783443438, now seen corresponding path program 1 times [2022-07-21 08:42:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:55,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782910808] [2022-07-21 08:42:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:55,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:55,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:55,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782910808] [2022-07-21 08:42:55,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782910808] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:55,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:55,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:42:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696937458] [2022-07-21 08:42:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:55,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:42:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:55,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:42:55,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:42:55,861 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 134 [2022-07-21 08:42:55,862 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 161 transitions, 883 flow. Second operand has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:55,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:55,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 134 [2022-07-21 08:42:55,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:56,665 INFO L129 PetriNetUnfolder]: 1229/5164 cut-off events. [2022-07-21 08:42:56,666 INFO L130 PetriNetUnfolder]: For 18283/20618 co-relation queries the response was YES. [2022-07-21 08:42:56,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17954 conditions, 5164 events. 1229/5164 cut-off events. For 18283/20618 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 64615 event pairs, 37 based on Foata normal form. 41/4738 useless extension candidates. Maximal degree in co-relation 17859. Up to 933 conditions per place. [2022-07-21 08:42:56,723 INFO L132 encePairwiseOnDemand]: 128/134 looper letters, 68 selfloop transitions, 2 changer transitions 5/198 dead transitions. [2022-07-21 08:42:56,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 198 transitions, 1366 flow [2022-07-21 08:42:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:42:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 08:42:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2022-07-21 08:42:56,725 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8550106609808102 [2022-07-21 08:42:56,725 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2022-07-21 08:42:56,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2022-07-21 08:42:56,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:56,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2022-07-21 08:42:56,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:56,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:56,728 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:56,728 INFO L186 Difference]: Start difference. First operand has 197 places, 161 transitions, 883 flow. Second operand 7 states and 802 transitions. [2022-07-21 08:42:56,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 198 transitions, 1366 flow [2022-07-21 08:42:56,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 198 transitions, 1145 flow, removed 72 selfloop flow, removed 22 redundant places. [2022-07-21 08:42:56,978 INFO L242 Difference]: Finished difference. Result has 182 places, 162 transitions, 725 flow [2022-07-21 08:42:56,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=725, PETRI_PLACES=182, PETRI_TRANSITIONS=162} [2022-07-21 08:42:56,978 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 41 predicate places. [2022-07-21 08:42:56,979 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 162 transitions, 725 flow [2022-07-21 08:42:56,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:56,979 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:56,979 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:56,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 08:42:56,980 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1559758952, now seen corresponding path program 2 times [2022-07-21 08:42:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612924956] [2022-07-21 08:42:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:56,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612924956] [2022-07-21 08:42:57,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612924956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:57,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:57,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 08:42:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425201965] [2022-07-21 08:42:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:57,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 08:42:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 08:42:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:42:57,166 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 134 [2022-07-21 08:42:57,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 162 transitions, 725 flow. Second operand has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:57,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:57,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 134 [2022-07-21 08:42:57,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:42:58,540 INFO L129 PetriNetUnfolder]: 2767/12206 cut-off events. [2022-07-21 08:42:58,540 INFO L130 PetriNetUnfolder]: For 16122/17365 co-relation queries the response was YES. [2022-07-21 08:42:58,749 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32640 conditions, 12206 events. 2767/12206 cut-off events. For 16122/17365 co-relation queries the response was YES. Maximal size of possible extension queue 1738. Compared 180539 event pairs, 15 based on Foata normal form. 47/11270 useless extension candidates. Maximal degree in co-relation 32609. Up to 1905 conditions per place. [2022-07-21 08:42:58,771 INFO L132 encePairwiseOnDemand]: 122/134 looper letters, 30 selfloop transitions, 5 changer transitions 96/247 dead transitions. [2022-07-21 08:42:58,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 247 transitions, 1635 flow [2022-07-21 08:42:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:42:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-21 08:42:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1537 transitions. [2022-07-21 08:42:58,774 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8192963752665245 [2022-07-21 08:42:58,774 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1537 transitions. [2022-07-21 08:42:58,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1537 transitions. [2022-07-21 08:42:58,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:42:58,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1537 transitions. [2022-07-21 08:42:58,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 109.78571428571429) internal successors, (1537), 14 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:58,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:58,781 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 134.0) internal successors, (2010), 15 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:58,781 INFO L186 Difference]: Start difference. First operand has 182 places, 162 transitions, 725 flow. Second operand 14 states and 1537 transitions. [2022-07-21 08:42:58,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 247 transitions, 1635 flow [2022-07-21 08:42:59,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 247 transitions, 1624 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-21 08:42:59,299 INFO L242 Difference]: Finished difference. Result has 196 places, 148 transitions, 620 flow [2022-07-21 08:42:59,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=620, PETRI_PLACES=196, PETRI_TRANSITIONS=148} [2022-07-21 08:42:59,299 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 55 predicate places. [2022-07-21 08:42:59,300 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 148 transitions, 620 flow [2022-07-21 08:42:59,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.0) internal successors, (1284), 12 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:59,300 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:42:59,300 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:42:59,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 08:42:59,301 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:42:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:42:59,301 INFO L85 PathProgramCache]: Analyzing trace with hash 15060044, now seen corresponding path program 3 times [2022-07-21 08:42:59,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:42:59,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568094193] [2022-07-21 08:42:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:42:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:42:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:42:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:42:59,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:42:59,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568094193] [2022-07-21 08:42:59,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568094193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:42:59,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:42:59,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 08:42:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770240433] [2022-07-21 08:42:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:42:59,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 08:42:59,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:42:59,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 08:42:59,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-07-21 08:42:59,603 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 134 [2022-07-21 08:42:59,605 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 148 transitions, 620 flow. Second operand has 14 states, 14 states have (on average 105.78571428571429) internal successors, (1481), 14 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:42:59,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 08:42:59,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 134 [2022-07-21 08:42:59,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 08:43:00,262 INFO L129 PetriNetUnfolder]: 871/4104 cut-off events. [2022-07-21 08:43:00,262 INFO L130 PetriNetUnfolder]: For 5070/5307 co-relation queries the response was YES. [2022-07-21 08:43:00,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10686 conditions, 4104 events. 871/4104 cut-off events. For 5070/5307 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 50722 event pairs, 5 based on Foata normal form. 4/3793 useless extension candidates. Maximal degree in co-relation 10654. Up to 661 conditions per place. [2022-07-21 08:43:00,296 INFO L132 encePairwiseOnDemand]: 123/134 looper letters, 25 selfloop transitions, 10 changer transitions 9/158 dead transitions. [2022-07-21 08:43:00,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 158 transitions, 764 flow [2022-07-21 08:43:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:43:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-21 08:43:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1181 transitions. [2022-07-21 08:43:00,298 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8012211668928086 [2022-07-21 08:43:00,298 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1181 transitions. [2022-07-21 08:43:00,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1181 transitions. [2022-07-21 08:43:00,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 08:43:00,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1181 transitions. [2022-07-21 08:43:00,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 107.36363636363636) internal successors, (1181), 11 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:00,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 134.0) internal successors, (1608), 12 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:00,302 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 134.0) internal successors, (1608), 12 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:00,303 INFO L186 Difference]: Start difference. First operand has 196 places, 148 transitions, 620 flow. Second operand 11 states and 1181 transitions. [2022-07-21 08:43:00,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 158 transitions, 764 flow [2022-07-21 08:43:00,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 158 transitions, 699 flow, removed 23 selfloop flow, removed 17 redundant places. [2022-07-21 08:43:00,372 INFO L242 Difference]: Finished difference. Result has 180 places, 147 transitions, 603 flow [2022-07-21 08:43:00,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=603, PETRI_PLACES=180, PETRI_TRANSITIONS=147} [2022-07-21 08:43:00,373 INFO L279 CegarLoopForPetriNet]: 141 programPoint places, 39 predicate places. [2022-07-21 08:43:00,373 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 147 transitions, 603 flow [2022-07-21 08:43:00,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 105.78571428571429) internal successors, (1481), 14 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 08:43:00,373 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 08:43:00,373 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:00,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 08:43:00,373 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-07-21 08:43:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:43:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash 394799084, now seen corresponding path program 4 times [2022-07-21 08:43:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:43:00,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736173503] [2022-07-21 08:43:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:43:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:43:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:43:00,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:43:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:43:00,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:43:00,513 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:43:00,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-21 08:43:00,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-21 08:43:00,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-21 08:43:00,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-21 08:43:00,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-21 08:43:00,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-21 08:43:00,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-21 08:43:00,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 08:43:00,520 INFO L356 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:43:00,527 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-21 08:43:00,528 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:43:00,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:43:00 BasicIcfg [2022-07-21 08:43:00,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:43:00,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:43:00,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:43:00,690 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:43:00,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:42:31" (3/4) ... [2022-07-21 08:43:00,692 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:43:00,831 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:43:00,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:43:00,832 INFO L158 Benchmark]: Toolchain (without parser) took 31059.35ms. Allocated memory was 56.6MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 33.3MB in the beginning and 5.8GB in the end (delta: -5.7GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-07-21 08:43:00,833 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:43:00,833 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.21ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 38.5MB in the end (delta: -5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 08:43:00,833 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.45ms. Allocated memory is still 69.2MB. Free memory was 38.5MB in the beginning and 50.8MB in the end (delta: -12.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-07-21 08:43:00,834 INFO L158 Benchmark]: Boogie Preprocessor took 49.59ms. Allocated memory is still 69.2MB. Free memory was 50.8MB in the beginning and 48.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:43:00,834 INFO L158 Benchmark]: RCFGBuilder took 1212.68ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 57.3MB in the end (delta: -8.8MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-07-21 08:43:00,834 INFO L158 Benchmark]: TraceAbstraction took 29021.19ms. Allocated memory was 88.1MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 56.7MB in the beginning and 5.8GB in the end (delta: -5.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-07-21 08:43:00,834 INFO L158 Benchmark]: Witness Printer took 141.51ms. Allocated memory is still 6.9GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-21 08:43:00,836 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.37ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 558.21ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 33.1MB in the beginning and 38.5MB in the end (delta: -5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.45ms. Allocated memory is still 69.2MB. Free memory was 38.5MB in the beginning and 50.8MB in the end (delta: -12.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.59ms. Allocated memory is still 69.2MB. Free memory was 50.8MB in the beginning and 48.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1212.68ms. Allocated memory was 69.2MB in the beginning and 88.1MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 57.3MB in the end (delta: -8.8MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29021.19ms. Allocated memory was 88.1MB in the beginning and 6.9GB in the end (delta: 6.8GB). Free memory was 56.7MB in the beginning and 5.8GB in the end (delta: -5.8GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 141.51ms. Allocated memory is still 6.9GB. Free memory was 5.8GB in the beginning and 5.8GB in the end (delta: 35.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L734] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L735] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L736] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L737] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L738] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L739] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L740] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L841] 0 pthread_t t1433; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 848]: 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: 844]: 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: 842]: 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: 846]: 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, 169 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: 28.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1255 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1255 mSDsluCounter, 1019 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1823 mSDsCounter, 492 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3443 IncrementalHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 492 mSolverCounterUnsat, 176 mSDtfsCounter, 3443 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1140occurred in iteration=15, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1786 ConstructedInterpolants, 0 QuantifiedInterpolants, 11602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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! [2022-07-21 08:43:00,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE