./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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/mix021_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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:05:27,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:05:27,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:05:27,877 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:05:27,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:05:27,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:05:27,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:05:27,881 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:05:27,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:05:27,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:05:27,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:05:27,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:05:27,886 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:05:27,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:05:27,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:05:27,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:05:27,889 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:05:27,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:05:27,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:05:27,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:05:27,895 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:05:27,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:05:27,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:05:27,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:05:27,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:05:27,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:05:27,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:05:27,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:05:27,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:05:27,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:05:27,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:05:27,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:05:27,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:05:27,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:05:27,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:05:27,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:05:27,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:05:27,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:05:27,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:05:27,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:05:27,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:05:27,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:05:27,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:05:27,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:05:27,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:05:27,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:05:27,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:05:27,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:05:27,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:05:27,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:05:27,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:05:27,953 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:05:27,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:05:27,954 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:05:27,954 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:05:27,954 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:05:27,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:05:27,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:05:27,955 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:05:27,955 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:05:27,955 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:05:27,955 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:05:27,956 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:05:27,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:05:27,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:05:27,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:05:27,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:05:27,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:27,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:05:27,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:05:27,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:05:27,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:05:27,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:05:27,959 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:05:27,959 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:05:27,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:05:27,959 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 [2022-07-12 10:05:28,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:05:28,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:05:28,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:05:28,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:05:28,186 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:05:28,187 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-07-12 10:05:28,258 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0ae9652/b56921f003e24dc38f056fa4bf3552b8/FLAG04e8b60f6 [2022-07-12 10:05:28,747 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:05:28,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix021_tso.oepc.i [2022-07-12 10:05:28,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0ae9652/b56921f003e24dc38f056fa4bf3552b8/FLAG04e8b60f6 [2022-07-12 10:05:29,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0ae9652/b56921f003e24dc38f056fa4bf3552b8 [2022-07-12 10:05:29,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:05:29,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:05:29,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:29,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:05:29,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:05:29,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf2141d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29, skipping insertion in model container [2022-07-12 10:05:29,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:05:29,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:05:29,255 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/mix021_tso.oepc.i[949,962] [2022-07-12 10:05:29,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:29,454 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:05:29,468 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/mix021_tso.oepc.i[949,962] [2022-07-12 10:05:29,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:05:29,549 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:05:29,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29 WrapperNode [2022-07-12 10:05:29,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:05:29,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:29,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:05:29,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:05:29,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,598 INFO L137 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-07-12 10:05:29,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:05:29,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:05:29,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:05:29,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:05:29,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:05:29,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:05:29,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:05:29,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:05:29,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (1/1) ... [2022-07-12 10:05:29,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:05:29,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:05:29,684 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-12 10:05:29,688 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-12 10:05:29,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:05:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:05:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:05:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:05:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:05:29,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:05:29,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:05:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:05:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:05:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:05:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:05:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-07-12 10:05:29,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-07-12 10:05:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:05:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:05:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:05:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:05:29,732 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:05:29,936 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:05:29,948 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:05:30,476 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:05:30,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:05:30,781 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:05:30,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:30 BoogieIcfgContainer [2022-07-12 10:05:30,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:05:30,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:05:30,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:05:30,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:05:30,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:05:29" (1/3) ... [2022-07-12 10:05:30,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7353f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:30, skipping insertion in model container [2022-07-12 10:05:30,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:05:29" (2/3) ... [2022-07-12 10:05:30,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7353f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:05:30, skipping insertion in model container [2022-07-12 10:05:30,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:30" (3/3) ... [2022-07-12 10:05:30,792 INFO L111 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-07-12 10:05:30,797 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:05:30,804 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:05:30,804 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:05:30,805 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:05:30,865 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:05:30,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-07-12 10:05:30,967 INFO L129 PetriNetUnfolder]: 2/132 cut-off events. [2022-07-12 10:05:30,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:30,972 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-07-12 10:05:30,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-07-12 10:05:30,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-07-12 10:05:30,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:05:30,995 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@77afb428, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@531c5b48 [2022-07-12 10:05:30,995 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 10:05:31,006 INFO L129 PetriNetUnfolder]: 0/76 cut-off events. [2022-07-12 10:05:31,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:05:31,007 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:31,007 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] [2022-07-12 10:05:31,008 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-12 10:05:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1884608713, now seen corresponding path program 1 times [2022-07-12 10:05:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:31,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862351577] [2022-07-12 10:05:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:31,336 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-12 10:05:31,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:31,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862351577] [2022-07-12 10:05:31,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862351577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:31,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:31,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:05:31,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486804337] [2022-07-12 10:05:31,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:31,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:05:31,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:05:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:05:31,379 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 136 [2022-07-12 10:05:31,385 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 10:05:31,385 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:31,385 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 136 [2022-07-12 10:05:31,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:31,567 INFO L129 PetriNetUnfolder]: 57/350 cut-off events. [2022-07-12 10:05:31,567 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-12 10:05:31,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 350 events. 57/350 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1377 event pairs, 11 based on Foata normal form. 14/345 useless extension candidates. Maximal degree in co-relation 422. Up to 75 conditions per place. [2022-07-12 10:05:31,572 INFO L132 encePairwiseOnDemand]: 131/136 looper letters, 14 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2022-07-12 10:05:31,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 133 transitions, 313 flow [2022-07-12 10:05:31,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:05:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:05:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-07-12 10:05:31,586 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-07-12 10:05:31,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-07-12 10:05:31,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-07-12 10:05:31,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:31,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-07-12 10:05:31,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-12 10:05:31,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-12 10:05:31,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-12 10:05:31,606 INFO L186 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-07-12 10:05:31,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 133 transitions, 313 flow [2022-07-12 10:05:31,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 133 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-07-12 10:05:31,614 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-07-12 10:05:31,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-07-12 10:05:31,620 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-07-12 10:05:31,620 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-07-12 10:05:31,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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-12 10:05:31,621 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:31,621 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] [2022-07-12 10:05:31,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:05:31,622 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-12 10:05:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash -966961645, now seen corresponding path program 1 times [2022-07-12 10:05:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:31,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829263218] [2022-07-12 10:05:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:31,893 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-12 10:05:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:31,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829263218] [2022-07-12 10:05:31,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829263218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:31,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:31,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916499184] [2022-07-12 10:05:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:31,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:31,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:31,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:31,898 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2022-07-12 10:05:31,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 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-12 10:05:31,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:31,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2022-07-12 10:05:31,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:32,351 INFO L129 PetriNetUnfolder]: 330/1147 cut-off events. [2022-07-12 10:05:32,351 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-07-12 10:05:32,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1778 conditions, 1147 events. 330/1147 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7711 event pairs, 59 based on Foata normal form. 0/1115 useless extension candidates. Maximal degree in co-relation 1722. Up to 257 conditions per place. [2022-07-12 10:05:32,360 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 19 selfloop transitions, 2 changer transitions 47/165 dead transitions. [2022-07-12 10:05:32,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 165 transitions, 466 flow [2022-07-12 10:05:32,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:05:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:05:32,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1083 transitions. [2022-07-12 10:05:32,367 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2022-07-12 10:05:32,367 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1083 transitions. [2022-07-12 10:05:32,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1083 transitions. [2022-07-12 10:05:32,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:32,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1083 transitions. [2022-07-12 10:05:32,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.33333333333333) internal successors, (1083), 9 states have internal predecessors, (1083), 0 states have call successors, (0), 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-12 10:05:32,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-12 10:05:32,375 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-12 10:05:32,375 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 9 states and 1083 transitions. [2022-07-12 10:05:32,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 165 transitions, 466 flow [2022-07-12 10:05:32,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 165 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:05:32,380 INFO L242 Difference]: Finished difference. Result has 152 places, 114 transitions, 256 flow [2022-07-12 10:05:32,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=152, PETRI_TRANSITIONS=114} [2022-07-12 10:05:32,382 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 9 predicate places. [2022-07-12 10:05:32,382 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 114 transitions, 256 flow [2022-07-12 10:05:32,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 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-12 10:05:32,383 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:32,383 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-12 10:05:32,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:05:32,383 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-12 10:05:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:32,384 INFO L85 PathProgramCache]: Analyzing trace with hash 618392066, now seen corresponding path program 1 times [2022-07-12 10:05:32,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:32,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254483989] [2022-07-12 10:05:32,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:32,573 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-12 10:05:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:32,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254483989] [2022-07-12 10:05:32,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254483989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:32,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:32,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:32,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394403800] [2022-07-12 10:05:32,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:32,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:32,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:32,577 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-07-12 10:05:32,578 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 114 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 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-12 10:05:32,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:32,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-07-12 10:05:32,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:33,048 INFO L129 PetriNetUnfolder]: 805/1618 cut-off events. [2022-07-12 10:05:33,049 INFO L130 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2022-07-12 10:05:33,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 1618 events. 805/1618 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9798 event pairs, 101 based on Foata normal form. 36/1614 useless extension candidates. Maximal degree in co-relation 3181. Up to 721 conditions per place. [2022-07-12 10:05:33,062 INFO L132 encePairwiseOnDemand]: 129/136 looper letters, 24 selfloop transitions, 3 changer transitions 40/163 dead transitions. [2022-07-12 10:05:33,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 163 transitions, 512 flow [2022-07-12 10:05:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:05:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:05:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-07-12 10:05:33,066 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8872549019607843 [2022-07-12 10:05:33,066 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-07-12 10:05:33,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-07-12 10:05:33,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:33,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-07-12 10:05:33,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 0 states have call successors, (0), 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-12 10:05:33,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-12 10:05:33,073 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-12 10:05:33,073 INFO L186 Difference]: Start difference. First operand has 152 places, 114 transitions, 256 flow. Second operand 9 states and 1086 transitions. [2022-07-12 10:05:33,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 163 transitions, 512 flow [2022-07-12 10:05:33,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 163 transitions, 480 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-07-12 10:05:33,086 INFO L242 Difference]: Finished difference. Result has 139 places, 116 transitions, 283 flow [2022-07-12 10:05:33,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=139, PETRI_TRANSITIONS=116} [2022-07-12 10:05:33,088 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-07-12 10:05:33,088 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 116 transitions, 283 flow [2022-07-12 10:05:33,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 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-12 10:05:33,089 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:33,089 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-12 10:05:33,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:05:33,089 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-12 10:05:33,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:33,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1424356281, now seen corresponding path program 1 times [2022-07-12 10:05:33,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:33,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704809268] [2022-07-12 10:05:33,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:33,325 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-12 10:05:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:33,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704809268] [2022-07-12 10:05:33,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704809268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:33,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:33,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:05:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374093306] [2022-07-12 10:05:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:33,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:05:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:05:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:05:33,329 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-07-12 10:05:33,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 116 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:33,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:33,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-07-12 10:05:33,331 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:33,928 INFO L129 PetriNetUnfolder]: 753/1559 cut-off events. [2022-07-12 10:05:33,929 INFO L130 PetriNetUnfolder]: For 1341/1351 co-relation queries the response was YES. [2022-07-12 10:05:33,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3664 conditions, 1559 events. 753/1559 cut-off events. For 1341/1351 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 9668 event pairs, 287 based on Foata normal form. 42/1535 useless extension candidates. Maximal degree in co-relation 3597. Up to 637 conditions per place. [2022-07-12 10:05:33,946 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 21 selfloop transitions, 10 changer transitions 44/171 dead transitions. [2022-07-12 10:05:33,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 171 transitions, 581 flow [2022-07-12 10:05:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:05:33,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:05:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1743 transitions. [2022-07-12 10:05:33,951 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8544117647058823 [2022-07-12 10:05:33,951 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1743 transitions. [2022-07-12 10:05:33,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1743 transitions. [2022-07-12 10:05:33,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:33,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1743 transitions. [2022-07-12 10:05:33,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 116.2) internal successors, (1743), 15 states have internal predecessors, (1743), 0 states have call successors, (0), 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-12 10:05:33,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 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-12 10:05:33,964 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 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-12 10:05:33,964 INFO L186 Difference]: Start difference. First operand has 139 places, 116 transitions, 283 flow. Second operand 15 states and 1743 transitions. [2022-07-12 10:05:33,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 171 transitions, 581 flow [2022-07-12 10:05:33,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 171 transitions, 560 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-07-12 10:05:33,972 INFO L242 Difference]: Finished difference. Result has 154 places, 122 transitions, 358 flow [2022-07-12 10:05:33,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=358, PETRI_PLACES=154, PETRI_TRANSITIONS=122} [2022-07-12 10:05:33,973 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 11 predicate places. [2022-07-12 10:05:33,974 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 122 transitions, 358 flow [2022-07-12 10:05:33,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.5) internal successors, (1125), 10 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:33,974 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:33,975 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-12 10:05:33,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:05:33,975 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-12 10:05:33,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1859946532, now seen corresponding path program 1 times [2022-07-12 10:05:33,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:33,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148498518] [2022-07-12 10:05:33,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:33,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:34,247 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-12 10:05:34,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:34,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148498518] [2022-07-12 10:05:34,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148498518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:34,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:34,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:05:34,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076749746] [2022-07-12 10:05:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:34,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:05:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:34,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:05:34,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:05:34,251 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:05:34,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 122 transitions, 358 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 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-12 10:05:34,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:34,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:05:34,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:34,781 INFO L129 PetriNetUnfolder]: 717/1564 cut-off events. [2022-07-12 10:05:34,782 INFO L130 PetriNetUnfolder]: For 4696/4715 co-relation queries the response was YES. [2022-07-12 10:05:34,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 1564 events. 717/1564 cut-off events. For 4696/4715 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9948 event pairs, 130 based on Foata normal form. 34/1543 useless extension candidates. Maximal degree in co-relation 5137. Up to 564 conditions per place. [2022-07-12 10:05:34,801 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 28 selfloop transitions, 8 changer transitions 31/164 dead transitions. [2022-07-12 10:05:34,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 164 transitions, 770 flow [2022-07-12 10:05:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:05:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:05:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1295 transitions. [2022-07-12 10:05:34,805 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8656417112299465 [2022-07-12 10:05:34,805 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1295 transitions. [2022-07-12 10:05:34,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1295 transitions. [2022-07-12 10:05:34,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:34,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1295 transitions. [2022-07-12 10:05:34,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 117.72727272727273) internal successors, (1295), 11 states have internal predecessors, (1295), 0 states have call successors, (0), 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-12 10:05:34,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-12 10:05:34,812 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-12 10:05:34,812 INFO L186 Difference]: Start difference. First operand has 154 places, 122 transitions, 358 flow. Second operand 11 states and 1295 transitions. [2022-07-12 10:05:34,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 164 transitions, 770 flow [2022-07-12 10:05:34,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 164 transitions, 746 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-07-12 10:05:34,822 INFO L242 Difference]: Finished difference. Result has 157 places, 125 transitions, 424 flow [2022-07-12 10:05:34,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=424, PETRI_PLACES=157, PETRI_TRANSITIONS=125} [2022-07-12 10:05:34,825 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 14 predicate places. [2022-07-12 10:05:34,825 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 125 transitions, 424 flow [2022-07-12 10:05:34,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 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-12 10:05:34,826 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:34,826 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] [2022-07-12 10:05:34,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:05:34,827 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-12 10:05:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:34,828 INFO L85 PathProgramCache]: Analyzing trace with hash 214341940, now seen corresponding path program 1 times [2022-07-12 10:05:34,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:34,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196210597] [2022-07-12 10:05:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:35,158 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-12 10:05:35,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:35,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196210597] [2022-07-12 10:05:35,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196210597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:35,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:35,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:05:35,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810180038] [2022-07-12 10:05:35,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:35,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:05:35,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:35,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:05:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:05:35,163 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-07-12 10:05:35,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 125 transitions, 424 flow. Second operand has 13 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 0 states have call successors, (0), 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-12 10:05:35,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:35,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-07-12 10:05:35,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:35,852 INFO L129 PetriNetUnfolder]: 579/1346 cut-off events. [2022-07-12 10:05:35,853 INFO L130 PetriNetUnfolder]: For 7769/7801 co-relation queries the response was YES. [2022-07-12 10:05:35,865 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5920 conditions, 1346 events. 579/1346 cut-off events. For 7769/7801 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8539 event pairs, 110 based on Foata normal form. 21/1311 useless extension candidates. Maximal degree in co-relation 5833. Up to 574 conditions per place. [2022-07-12 10:05:35,915 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 41 selfloop transitions, 13 changer transitions 25/173 dead transitions. [2022-07-12 10:05:35,915 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 173 transitions, 1037 flow [2022-07-12 10:05:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 10:05:35,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-07-12 10:05:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1923 transitions. [2022-07-12 10:05:35,920 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8317474048442907 [2022-07-12 10:05:35,920 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1923 transitions. [2022-07-12 10:05:35,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1923 transitions. [2022-07-12 10:05:35,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:35,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1923 transitions. [2022-07-12 10:05:35,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 113.11764705882354) internal successors, (1923), 17 states have internal predecessors, (1923), 0 states have call successors, (0), 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-12 10:05:35,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 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-12 10:05:35,930 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 136.0) internal successors, (2448), 18 states have internal predecessors, (2448), 0 states have call successors, (0), 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-12 10:05:35,930 INFO L186 Difference]: Start difference. First operand has 157 places, 125 transitions, 424 flow. Second operand 17 states and 1923 transitions. [2022-07-12 10:05:35,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 173 transitions, 1037 flow [2022-07-12 10:05:35,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 173 transitions, 984 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-07-12 10:05:35,942 INFO L242 Difference]: Finished difference. Result has 172 places, 130 transitions, 512 flow [2022-07-12 10:05:35,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=512, PETRI_PLACES=172, PETRI_TRANSITIONS=130} [2022-07-12 10:05:35,943 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 29 predicate places. [2022-07-12 10:05:35,944 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 130 transitions, 512 flow [2022-07-12 10:05:35,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 0 states have call successors, (0), 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-12 10:05:35,945 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:35,945 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] [2022-07-12 10:05:35,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:05:35,945 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-12 10:05:35,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:35,946 INFO L85 PathProgramCache]: Analyzing trace with hash -291309004, now seen corresponding path program 2 times [2022-07-12 10:05:35,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:35,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137324376] [2022-07-12 10:05:35,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:35,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:36,203 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-12 10:05:36,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:36,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137324376] [2022-07-12 10:05:36,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137324376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:36,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:36,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:05:36,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288329538] [2022-07-12 10:05:36,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:36,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:05:36,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:36,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:05:36,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:05:36,208 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:05:36,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 130 transitions, 512 flow. Second operand has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 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-12 10:05:36,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:36,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:05:36,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:36,866 INFO L129 PetriNetUnfolder]: 587/1532 cut-off events. [2022-07-12 10:05:36,866 INFO L130 PetriNetUnfolder]: For 13112/13163 co-relation queries the response was YES. [2022-07-12 10:05:36,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7291 conditions, 1532 events. 587/1532 cut-off events. For 13112/13163 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10223 event pairs, 70 based on Foata normal form. 22/1485 useless extension candidates. Maximal degree in co-relation 7194. Up to 456 conditions per place. [2022-07-12 10:05:36,893 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 40 selfloop transitions, 21 changer transitions 35/191 dead transitions. [2022-07-12 10:05:36,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 191 transitions, 1513 flow [2022-07-12 10:05:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 10:05:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-12 10:05:36,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2289 transitions. [2022-07-12 10:05:36,899 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8415441176470588 [2022-07-12 10:05:36,899 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2289 transitions. [2022-07-12 10:05:36,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2289 transitions. [2022-07-12 10:05:36,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:36,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2289 transitions. [2022-07-12 10:05:36,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 114.45) internal successors, (2289), 20 states have internal predecessors, (2289), 0 states have call successors, (0), 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-12 10:05:36,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 136.0) internal successors, (2856), 21 states have internal predecessors, (2856), 0 states have call successors, (0), 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-12 10:05:36,909 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 136.0) internal successors, (2856), 21 states have internal predecessors, (2856), 0 states have call successors, (0), 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-12 10:05:36,910 INFO L186 Difference]: Start difference. First operand has 172 places, 130 transitions, 512 flow. Second operand 20 states and 2289 transitions. [2022-07-12 10:05:36,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 191 transitions, 1513 flow [2022-07-12 10:05:36,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 191 transitions, 1298 flow, removed 98 selfloop flow, removed 14 redundant places. [2022-07-12 10:05:36,927 INFO L242 Difference]: Finished difference. Result has 182 places, 136 transitions, 639 flow [2022-07-12 10:05:36,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=639, PETRI_PLACES=182, PETRI_TRANSITIONS=136} [2022-07-12 10:05:36,928 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 39 predicate places. [2022-07-12 10:05:36,928 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 136 transitions, 639 flow [2022-07-12 10:05:36,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.63636363636364) internal successors, (1228), 11 states have internal predecessors, (1228), 0 states have call successors, (0), 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-12 10:05:36,929 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:36,929 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] [2022-07-12 10:05:36,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:05:36,930 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-12 10:05:36,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:36,930 INFO L85 PathProgramCache]: Analyzing trace with hash -965625480, now seen corresponding path program 1 times [2022-07-12 10:05:36,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:36,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919432368] [2022-07-12 10:05:36,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:36,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:37,111 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-12 10:05:37,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:37,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919432368] [2022-07-12 10:05:37,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919432368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:37,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:37,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 10:05:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122514261] [2022-07-12 10:05:37,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:37,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:05:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:37,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:05:37,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:05:37,114 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-07-12 10:05:37,116 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 136 transitions, 639 flow. Second operand has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12 10:05:37,116 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:37,116 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-07-12 10:05:37,116 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:37,607 INFO L129 PetriNetUnfolder]: 571/1392 cut-off events. [2022-07-12 10:05:37,607 INFO L130 PetriNetUnfolder]: For 16564/16972 co-relation queries the response was YES. [2022-07-12 10:05:37,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7500 conditions, 1392 events. 571/1392 cut-off events. For 16564/16972 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8724 event pairs, 108 based on Foata normal form. 34/1340 useless extension candidates. Maximal degree in co-relation 7399. Up to 649 conditions per place. [2022-07-12 10:05:37,658 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 35 selfloop transitions, 13 changer transitions 47/191 dead transitions. [2022-07-12 10:05:37,659 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 191 transitions, 1566 flow [2022-07-12 10:05:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:05:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:05:37,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1845 transitions. [2022-07-12 10:05:37,663 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8478860294117647 [2022-07-12 10:05:37,664 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1845 transitions. [2022-07-12 10:05:37,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1845 transitions. [2022-07-12 10:05:37,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:37,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1845 transitions. [2022-07-12 10:05:37,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 115.3125) internal successors, (1845), 16 states have internal predecessors, (1845), 0 states have call successors, (0), 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-12 10:05:37,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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-12 10:05:37,673 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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-12 10:05:37,673 INFO L186 Difference]: Start difference. First operand has 182 places, 136 transitions, 639 flow. Second operand 16 states and 1845 transitions. [2022-07-12 10:05:37,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 191 transitions, 1566 flow [2022-07-12 10:05:37,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 191 transitions, 1381 flow, removed 82 selfloop flow, removed 16 redundant places. [2022-07-12 10:05:37,696 INFO L242 Difference]: Finished difference. Result has 180 places, 139 transitions, 703 flow [2022-07-12 10:05:37,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=703, PETRI_PLACES=180, PETRI_TRANSITIONS=139} [2022-07-12 10:05:37,697 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 37 predicate places. [2022-07-12 10:05:37,697 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 139 transitions, 703 flow [2022-07-12 10:05:37,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.6) internal successors, (1126), 10 states have internal predecessors, (1126), 0 states have call successors, (0), 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-12 10:05:37,698 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:37,698 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-12 10:05:37,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:05:37,698 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-12 10:05:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -470108679, now seen corresponding path program 1 times [2022-07-12 10:05:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:37,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885084174] [2022-07-12 10:05:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:37,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:37,905 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-12 10:05:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:37,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885084174] [2022-07-12 10:05:37,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885084174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:37,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:37,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:05:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551972710] [2022-07-12 10:05:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:37,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:05:37,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:37,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:05:37,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:05:37,909 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-07-12 10:05:37,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 139 transitions, 703 flow. Second operand has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 0 states have call successors, (0), 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-12 10:05:37,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:37,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-07-12 10:05:37,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:38,387 INFO L129 PetriNetUnfolder]: 469/1149 cut-off events. [2022-07-12 10:05:38,388 INFO L130 PetriNetUnfolder]: For 13976/14270 co-relation queries the response was YES. [2022-07-12 10:05:38,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6409 conditions, 1149 events. 469/1149 cut-off events. For 13976/14270 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6942 event pairs, 68 based on Foata normal form. 38/1132 useless extension candidates. Maximal degree in co-relation 6308. Up to 544 conditions per place. [2022-07-12 10:05:38,424 INFO L132 encePairwiseOnDemand]: 124/136 looper letters, 40 selfloop transitions, 14 changer transitions 19/169 dead transitions. [2022-07-12 10:05:38,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 169 transitions, 1207 flow [2022-07-12 10:05:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:38,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1500 transitions. [2022-07-12 10:05:38,429 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8484162895927602 [2022-07-12 10:05:38,430 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1500 transitions. [2022-07-12 10:05:38,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1500 transitions. [2022-07-12 10:05:38,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:38,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1500 transitions. [2022-07-12 10:05:38,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.38461538461539) internal successors, (1500), 13 states have internal predecessors, (1500), 0 states have call successors, (0), 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-12 10:05:38,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:38,438 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:38,438 INFO L186 Difference]: Start difference. First operand has 180 places, 139 transitions, 703 flow. Second operand 13 states and 1500 transitions. [2022-07-12 10:05:38,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 169 transitions, 1207 flow [2022-07-12 10:05:38,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 169 transitions, 1091 flow, removed 51 selfloop flow, removed 10 redundant places. [2022-07-12 10:05:38,465 INFO L242 Difference]: Finished difference. Result has 181 places, 142 transitions, 708 flow [2022-07-12 10:05:38,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=708, PETRI_PLACES=181, PETRI_TRANSITIONS=142} [2022-07-12 10:05:38,466 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 38 predicate places. [2022-07-12 10:05:38,467 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 142 transitions, 708 flow [2022-07-12 10:05:38,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 0 states have call successors, (0), 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-12 10:05:38,467 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:38,468 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-12 10:05:38,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:05:38,468 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-12 10:05:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash -675305640, now seen corresponding path program 1 times [2022-07-12 10:05:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:38,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381702191] [2022-07-12 10:05:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:38,725 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-12 10:05:38,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:38,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381702191] [2022-07-12 10:05:38,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381702191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:38,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:38,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 10:05:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085837636] [2022-07-12 10:05:38,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:38,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 10:05:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:38,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 10:05:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-12 10:05:38,729 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2022-07-12 10:05:38,730 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 142 transitions, 708 flow. Second operand has 11 states, 11 states have (on average 109.9090909090909) internal successors, (1209), 11 states have internal predecessors, (1209), 0 states have call successors, (0), 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-12 10:05:38,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:38,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2022-07-12 10:05:38,731 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:39,283 INFO L129 PetriNetUnfolder]: 483/1280 cut-off events. [2022-07-12 10:05:39,283 INFO L130 PetriNetUnfolder]: For 15057/15305 co-relation queries the response was YES. [2022-07-12 10:05:39,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6813 conditions, 1280 events. 483/1280 cut-off events. For 15057/15305 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8141 event pairs, 108 based on Foata normal form. 25/1231 useless extension candidates. Maximal degree in co-relation 6707. Up to 562 conditions per place. [2022-07-12 10:05:39,319 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 43 selfloop transitions, 18 changer transitions 19/173 dead transitions. [2022-07-12 10:05:39,320 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 173 transitions, 1331 flow [2022-07-12 10:05:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1464 transitions. [2022-07-12 10:05:39,325 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8280542986425339 [2022-07-12 10:05:39,325 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1464 transitions. [2022-07-12 10:05:39,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1464 transitions. [2022-07-12 10:05:39,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:39,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1464 transitions. [2022-07-12 10:05:39,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 112.61538461538461) internal successors, (1464), 13 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:05:39,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:39,340 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:39,340 INFO L186 Difference]: Start difference. First operand has 181 places, 142 transitions, 708 flow. Second operand 13 states and 1464 transitions. [2022-07-12 10:05:39,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 173 transitions, 1331 flow [2022-07-12 10:05:39,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 1263 flow, removed 26 selfloop flow, removed 13 redundant places. [2022-07-12 10:05:39,367 INFO L242 Difference]: Finished difference. Result has 181 places, 146 transitions, 805 flow [2022-07-12 10:05:39,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=805, PETRI_PLACES=181, PETRI_TRANSITIONS=146} [2022-07-12 10:05:39,369 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 38 predicate places. [2022-07-12 10:05:39,369 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 146 transitions, 805 flow [2022-07-12 10:05:39,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 109.9090909090909) internal successors, (1209), 11 states have internal predecessors, (1209), 0 states have call successors, (0), 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-12 10:05:39,370 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:39,370 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-12 10:05:39,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:05:39,371 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-12 10:05:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:39,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1068602500, now seen corresponding path program 2 times [2022-07-12 10:05:39,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:39,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223250398] [2022-07-12 10:05:39,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:39,605 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-12 10:05:39,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:39,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223250398] [2022-07-12 10:05:39,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223250398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:39,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:39,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 10:05:39,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185028750] [2022-07-12 10:05:39,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:39,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 10:05:39,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:39,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 10:05:39,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-12 10:05:39,609 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2022-07-12 10:05:39,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 146 transitions, 805 flow. Second operand has 13 states, 13 states have (on average 109.61538461538461) internal successors, (1425), 13 states have internal predecessors, (1425), 0 states have call successors, (0), 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-12 10:05:39,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:39,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2022-07-12 10:05:39,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:40,014 INFO L129 PetriNetUnfolder]: 492/1246 cut-off events. [2022-07-12 10:05:40,014 INFO L130 PetriNetUnfolder]: For 19799/20271 co-relation queries the response was YES. [2022-07-12 10:05:40,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7556 conditions, 1246 events. 492/1246 cut-off events. For 19799/20271 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7778 event pairs, 74 based on Foata normal form. 31/1215 useless extension candidates. Maximal degree in co-relation 7452. Up to 583 conditions per place. [2022-07-12 10:05:40,039 INFO L132 encePairwiseOnDemand]: 123/136 looper letters, 44 selfloop transitions, 27 changer transitions 10/174 dead transitions. [2022-07-12 10:05:40,039 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 174 transitions, 1442 flow [2022-07-12 10:05:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:05:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:05:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1238 transitions. [2022-07-12 10:05:40,042 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8275401069518716 [2022-07-12 10:05:40,042 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1238 transitions. [2022-07-12 10:05:40,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1238 transitions. [2022-07-12 10:05:40,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:40,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1238 transitions. [2022-07-12 10:05:40,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.54545454545455) internal successors, (1238), 11 states have internal predecessors, (1238), 0 states have call successors, (0), 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-12 10:05:40,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-12 10:05:40,047 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 136.0) internal successors, (1632), 12 states have internal predecessors, (1632), 0 states have call successors, (0), 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-12 10:05:40,047 INFO L186 Difference]: Start difference. First operand has 181 places, 146 transitions, 805 flow. Second operand 11 states and 1238 transitions. [2022-07-12 10:05:40,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 174 transitions, 1442 flow [2022-07-12 10:05:40,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 174 transitions, 1255 flow, removed 76 selfloop flow, removed 11 redundant places. [2022-07-12 10:05:40,103 INFO L242 Difference]: Finished difference. Result has 178 places, 157 transitions, 962 flow [2022-07-12 10:05:40,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=962, PETRI_PLACES=178, PETRI_TRANSITIONS=157} [2022-07-12 10:05:40,104 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 35 predicate places. [2022-07-12 10:05:40,104 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 157 transitions, 962 flow [2022-07-12 10:05:40,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 109.61538461538461) internal successors, (1425), 13 states have internal predecessors, (1425), 0 states have call successors, (0), 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-12 10:05:40,105 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:40,105 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-12 10:05:40,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:05:40,105 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-12 10:05:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:40,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1079473952, now seen corresponding path program 1 times [2022-07-12 10:05:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:40,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100262242] [2022-07-12 10:05:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:40,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:40,211 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-12 10:05:40,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100262242] [2022-07-12 10:05:40,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100262242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:40,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:40,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:40,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738585605] [2022-07-12 10:05:40,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:40,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:40,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:40,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:40,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:40,214 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-07-12 10:05:40,215 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 157 transitions, 962 flow. Second operand has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 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-12 10:05:40,215 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:40,215 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-07-12 10:05:40,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:40,944 INFO L129 PetriNetUnfolder]: 1373/3009 cut-off events. [2022-07-12 10:05:40,945 INFO L130 PetriNetUnfolder]: For 39904/41923 co-relation queries the response was YES. [2022-07-12 10:05:40,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16645 conditions, 3009 events. 1373/3009 cut-off events. For 39904/41923 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22518 event pairs, 168 based on Foata normal form. 164/2989 useless extension candidates. Maximal degree in co-relation 16547. Up to 1078 conditions per place. [2022-07-12 10:05:40,989 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 110 selfloop transitions, 2 changer transitions 22/234 dead transitions. [2022-07-12 10:05:40,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 234 transitions, 2321 flow [2022-07-12 10:05:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:05:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:05:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 825 transitions. [2022-07-12 10:05:40,991 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8665966386554622 [2022-07-12 10:05:40,992 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 825 transitions. [2022-07-12 10:05:40,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 825 transitions. [2022-07-12 10:05:40,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:40,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 825 transitions. [2022-07-12 10:05:40,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 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-12 10:05:40,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12 10:05:40,995 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12 10:05:40,995 INFO L186 Difference]: Start difference. First operand has 178 places, 157 transitions, 962 flow. Second operand 7 states and 825 transitions. [2022-07-12 10:05:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 234 transitions, 2321 flow [2022-07-12 10:05:41,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 234 transitions, 2069 flow, removed 95 selfloop flow, removed 9 redundant places. [2022-07-12 10:05:41,061 INFO L242 Difference]: Finished difference. Result has 177 places, 158 transitions, 869 flow [2022-07-12 10:05:41,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=869, PETRI_PLACES=177, PETRI_TRANSITIONS=158} [2022-07-12 10:05:41,062 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 34 predicate places. [2022-07-12 10:05:41,062 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 158 transitions, 869 flow [2022-07-12 10:05:41,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 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-12 10:05:41,063 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:41,063 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-12 10:05:41,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:05:41,063 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-12 10:05:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2123532730, now seen corresponding path program 2 times [2022-07-12 10:05:41,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:41,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614998926] [2022-07-12 10:05:41,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:41,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:41,160 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-12 10:05:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:41,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614998926] [2022-07-12 10:05:41,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614998926] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:41,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:41,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484087828] [2022-07-12 10:05:41,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:41,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:41,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:41,165 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:05:41,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 158 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-12 10:05:41,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:41,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:05:41,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:43,691 INFO L129 PetriNetUnfolder]: 9174/15641 cut-off events. [2022-07-12 10:05:43,691 INFO L130 PetriNetUnfolder]: For 191227/195436 co-relation queries the response was YES. [2022-07-12 10:05:43,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70304 conditions, 15641 events. 9174/15641 cut-off events. For 191227/195436 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 128640 event pairs, 358 based on Foata normal form. 1235/15795 useless extension candidates. Maximal degree in co-relation 70209. Up to 5561 conditions per place. [2022-07-12 10:05:43,876 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 232 selfloop transitions, 20 changer transitions 15/366 dead transitions. [2022-07-12 10:05:43,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 366 transitions, 3400 flow [2022-07-12 10:05:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:05:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:05:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1192 transitions. [2022-07-12 10:05:43,879 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8764705882352941 [2022-07-12 10:05:43,880 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1192 transitions. [2022-07-12 10:05:43,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1192 transitions. [2022-07-12 10:05:43,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:43,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1192 transitions. [2022-07-12 10:05:43,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.2) internal successors, (1192), 10 states have internal predecessors, (1192), 0 states have call successors, (0), 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-12 10:05:43,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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-12 10:05:43,885 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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-12 10:05:43,885 INFO L186 Difference]: Start difference. First operand has 177 places, 158 transitions, 869 flow. Second operand 10 states and 1192 transitions. [2022-07-12 10:05:43,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 366 transitions, 3400 flow [2022-07-12 10:05:43,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 366 transitions, 3389 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-07-12 10:05:43,991 INFO L242 Difference]: Finished difference. Result has 185 places, 176 transitions, 1001 flow [2022-07-12 10:05:43,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1001, PETRI_PLACES=185, PETRI_TRANSITIONS=176} [2022-07-12 10:05:43,992 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 42 predicate places. [2022-07-12 10:05:43,992 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 176 transitions, 1001 flow [2022-07-12 10:05:43,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 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-12 10:05:43,993 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:43,993 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] [2022-07-12 10:05:43,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 10:05:43,993 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-12 10:05:43,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1630683781, now seen corresponding path program 1 times [2022-07-12 10:05:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:43,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182626518] [2022-07-12 10:05:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:44,294 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-12 10:05:44,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:44,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182626518] [2022-07-12 10:05:44,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182626518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:44,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:44,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-12 10:05:44,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170144657] [2022-07-12 10:05:44,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:44,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:05:44,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:44,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:05:44,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 10:05:44,297 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:05:44,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 176 transitions, 1001 flow. Second operand has 12 states, 12 states have (on average 111.58333333333333) internal successors, (1339), 12 states have internal predecessors, (1339), 0 states have call successors, (0), 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-12 10:05:44,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:44,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:05:44,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:45,410 INFO L129 PetriNetUnfolder]: 1848/5560 cut-off events. [2022-07-12 10:05:45,410 INFO L130 PetriNetUnfolder]: For 53734/55598 co-relation queries the response was YES. [2022-07-12 10:05:45,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25186 conditions, 5560 events. 1848/5560 cut-off events. For 53734/55598 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 57746 event pairs, 518 based on Foata normal form. 180/5310 useless extension candidates. Maximal degree in co-relation 25082. Up to 1494 conditions per place. [2022-07-12 10:05:45,608 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 55 selfloop transitions, 46 changer transitions 0/215 dead transitions. [2022-07-12 10:05:45,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 215 transitions, 1829 flow [2022-07-12 10:05:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1493 transitions. [2022-07-12 10:05:45,611 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8444570135746606 [2022-07-12 10:05:45,612 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1493 transitions. [2022-07-12 10:05:45,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1493 transitions. [2022-07-12 10:05:45,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:45,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1493 transitions. [2022-07-12 10:05:45,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.84615384615384) internal successors, (1493), 13 states have internal predecessors, (1493), 0 states have call successors, (0), 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-12 10:05:45,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:45,617 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:45,617 INFO L186 Difference]: Start difference. First operand has 185 places, 176 transitions, 1001 flow. Second operand 13 states and 1493 transitions. [2022-07-12 10:05:45,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 215 transitions, 1829 flow [2022-07-12 10:05:45,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 1827 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:05:45,671 INFO L242 Difference]: Finished difference. Result has 203 places, 195 transitions, 1589 flow [2022-07-12 10:05:45,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1589, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2022-07-12 10:05:45,672 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 60 predicate places. [2022-07-12 10:05:45,672 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 1589 flow [2022-07-12 10:05:45,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.58333333333333) internal successors, (1339), 12 states have internal predecessors, (1339), 0 states have call successors, (0), 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-12 10:05:45,673 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:45,673 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] [2022-07-12 10:05:45,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 10:05:45,673 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-12 10:05:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2002683905, now seen corresponding path program 1 times [2022-07-12 10:05:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:45,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200050799] [2022-07-12 10:05:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:45,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:45,778 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-12 10:05:45,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:45,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200050799] [2022-07-12 10:05:45,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200050799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:45,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:45,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414611461] [2022-07-12 10:05:45,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:45,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:45,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:45,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:45,781 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:05:45,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 1589 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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-12 10:05:45,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:45,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:05:45,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:48,793 INFO L129 PetriNetUnfolder]: 9416/17043 cut-off events. [2022-07-12 10:05:48,794 INFO L130 PetriNetUnfolder]: For 308657/313059 co-relation queries the response was YES. [2022-07-12 10:05:48,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96052 conditions, 17043 events. 9416/17043 cut-off events. For 308657/313059 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 153137 event pairs, 177 based on Foata normal form. 1692/17969 useless extension candidates. Maximal degree in co-relation 95942. Up to 5055 conditions per place. [2022-07-12 10:05:48,978 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 271 selfloop transitions, 34 changer transitions 89/493 dead transitions. [2022-07-12 10:05:48,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 493 transitions, 6647 flow [2022-07-12 10:05:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:05:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:05:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1553 transitions. [2022-07-12 10:05:48,981 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.878393665158371 [2022-07-12 10:05:48,982 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1553 transitions. [2022-07-12 10:05:48,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1553 transitions. [2022-07-12 10:05:48,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:48,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1553 transitions. [2022-07-12 10:05:48,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.46153846153847) internal successors, (1553), 13 states have internal predecessors, (1553), 0 states have call successors, (0), 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-12 10:05:48,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:48,987 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-12 10:05:48,988 INFO L186 Difference]: Start difference. First operand has 203 places, 195 transitions, 1589 flow. Second operand 13 states and 1553 transitions. [2022-07-12 10:05:48,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 493 transitions, 6647 flow [2022-07-12 10:05:49,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 493 transitions, 5886 flow, removed 353 selfloop flow, removed 3 redundant places. [2022-07-12 10:05:49,487 INFO L242 Difference]: Finished difference. Result has 218 places, 188 transitions, 1314 flow [2022-07-12 10:05:49,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1314, PETRI_PLACES=218, PETRI_TRANSITIONS=188} [2022-07-12 10:05:49,488 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 75 predicate places. [2022-07-12 10:05:49,488 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 188 transitions, 1314 flow [2022-07-12 10:05:49,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 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-12 10:05:49,489 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:49,489 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] [2022-07-12 10:05:49,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 10:05:49,489 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-12 10:05:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash -963965080, now seen corresponding path program 1 times [2022-07-12 10:05:49,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:49,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886288394] [2022-07-12 10:05:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:49,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:49,572 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-12 10:05:49,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:49,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886288394] [2022-07-12 10:05:49,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886288394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:49,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:49,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:05:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312607494] [2022-07-12 10:05:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:49,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:05:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:49,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:05:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:05:49,578 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 136 [2022-07-12 10:05:49,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 188 transitions, 1314 flow. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 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-12 10:05:49,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:49,579 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 136 [2022-07-12 10:05:49,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:51,399 INFO L129 PetriNetUnfolder]: 2867/10267 cut-off events. [2022-07-12 10:05:51,400 INFO L130 PetriNetUnfolder]: For 90437/102969 co-relation queries the response was YES. [2022-07-12 10:05:51,480 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45607 conditions, 10267 events. 2867/10267 cut-off events. For 90437/102969 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 129721 event pairs, 285 based on Foata normal form. 313/9764 useless extension candidates. Maximal degree in co-relation 45491. Up to 2544 conditions per place. [2022-07-12 10:05:51,522 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 101 selfloop transitions, 11 changer transitions 35/282 dead transitions. [2022-07-12 10:05:51,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 282 transitions, 3064 flow [2022-07-12 10:05:51,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:05:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:05:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1078 transitions. [2022-07-12 10:05:51,524 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.880718954248366 [2022-07-12 10:05:51,525 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1078 transitions. [2022-07-12 10:05:51,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1078 transitions. [2022-07-12 10:05:51,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:51,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1078 transitions. [2022-07-12 10:05:51,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 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-12 10:05:51,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-12 10:05:51,529 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-12 10:05:51,529 INFO L186 Difference]: Start difference. First operand has 218 places, 188 transitions, 1314 flow. Second operand 9 states and 1078 transitions. [2022-07-12 10:05:51,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 282 transitions, 3064 flow [2022-07-12 10:05:52,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 282 transitions, 2887 flow, removed 80 selfloop flow, removed 10 redundant places. [2022-07-12 10:05:52,061 INFO L242 Difference]: Finished difference. Result has 217 places, 196 transitions, 1364 flow [2022-07-12 10:05:52,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1364, PETRI_PLACES=217, PETRI_TRANSITIONS=196} [2022-07-12 10:05:52,062 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 74 predicate places. [2022-07-12 10:05:52,062 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 196 transitions, 1364 flow [2022-07-12 10:05:52,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 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-12 10:05:52,063 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:52,063 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-12 10:05:52,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 10:05:52,063 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-12 10:05:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1213038171, now seen corresponding path program 1 times [2022-07-12 10:05:52,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:52,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49978924] [2022-07-12 10:05:52,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:52,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:52,170 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-12 10:05:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:52,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49978924] [2022-07-12 10:05:52,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49978924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:52,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:52,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:05:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469882823] [2022-07-12 10:05:52,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:52,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:05:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:05:52,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:05:52,173 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:05:52,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 196 transitions, 1364 flow. Second operand has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 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-12 10:05:52,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:52,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:05:52,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:56,536 INFO L129 PetriNetUnfolder]: 12304/23118 cut-off events. [2022-07-12 10:05:56,536 INFO L130 PetriNetUnfolder]: For 339104/343819 co-relation queries the response was YES. [2022-07-12 10:05:56,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126080 conditions, 23118 events. 12304/23118 cut-off events. For 339104/343819 co-relation queries the response was YES. Maximal size of possible extension queue 1946. Compared 230895 event pairs, 94 based on Foata normal form. 1763/23839 useless extension candidates. Maximal degree in co-relation 125964. Up to 6721 conditions per place. [2022-07-12 10:05:56,767 INFO L132 encePairwiseOnDemand]: 125/136 looper letters, 100 selfloop transitions, 15 changer transitions 296/508 dead transitions. [2022-07-12 10:05:56,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 508 transitions, 6330 flow [2022-07-12 10:05:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 10:05:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-07-12 10:05:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1909 transitions. [2022-07-12 10:05:56,771 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8772977941176471 [2022-07-12 10:05:56,772 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1909 transitions. [2022-07-12 10:05:56,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1909 transitions. [2022-07-12 10:05:56,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:56,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1909 transitions. [2022-07-12 10:05:56,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.3125) internal successors, (1909), 16 states have internal predecessors, (1909), 0 states have call successors, (0), 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-12 10:05:56,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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-12 10:05:56,779 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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-12 10:05:56,780 INFO L186 Difference]: Start difference. First operand has 217 places, 196 transitions, 1364 flow. Second operand 16 states and 1909 transitions. [2022-07-12 10:05:56,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 508 transitions, 6330 flow [2022-07-12 10:05:57,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 508 transitions, 6235 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-07-12 10:05:57,977 INFO L242 Difference]: Finished difference. Result has 235 places, 152 transitions, 1017 flow [2022-07-12 10:05:57,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1017, PETRI_PLACES=235, PETRI_TRANSITIONS=152} [2022-07-12 10:05:57,978 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 92 predicate places. [2022-07-12 10:05:57,978 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 152 transitions, 1017 flow [2022-07-12 10:05:57,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.25) internal successors, (898), 8 states have internal predecessors, (898), 0 states have call successors, (0), 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-12 10:05:57,983 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:57,983 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] [2022-07-12 10:05:57,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 10:05:57,984 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-12 10:05:57,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1236686199, now seen corresponding path program 1 times [2022-07-12 10:05:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:57,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067023284] [2022-07-12 10:05:57,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:58,116 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-12 10:05:58,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:58,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067023284] [2022-07-12 10:05:58,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067023284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:58,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:58,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 10:05:58,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87032562] [2022-07-12 10:05:58,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:58,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 10:05:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 10:05:58,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 10:05:58,119 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2022-07-12 10:05:58,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 152 transitions, 1017 flow. Second operand has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 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-12 10:05:58,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:58,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2022-07-12 10:05:58,121 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:58,792 INFO L129 PetriNetUnfolder]: 978/2480 cut-off events. [2022-07-12 10:05:58,792 INFO L130 PetriNetUnfolder]: For 33288/33682 co-relation queries the response was YES. [2022-07-12 10:05:58,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12909 conditions, 2480 events. 978/2480 cut-off events. For 33288/33682 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 19658 event pairs, 18 based on Foata normal form. 120/2486 useless extension candidates. Maximal degree in co-relation 12845. Up to 610 conditions per place. [2022-07-12 10:05:58,818 INFO L132 encePairwiseOnDemand]: 126/136 looper letters, 77 selfloop transitions, 19 changer transitions 40/233 dead transitions. [2022-07-12 10:05:58,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 233 transitions, 2468 flow [2022-07-12 10:05:58,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 10:05:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-07-12 10:05:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1396 transitions. [2022-07-12 10:05:58,824 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8553921568627451 [2022-07-12 10:05:58,824 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1396 transitions. [2022-07-12 10:05:58,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1396 transitions. [2022-07-12 10:05:58,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:58,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1396 transitions. [2022-07-12 10:05:58,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 116.33333333333333) internal successors, (1396), 12 states have internal predecessors, (1396), 0 states have call successors, (0), 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-12 10:05:58,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 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-12 10:05:58,829 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 136.0) internal successors, (1768), 13 states have internal predecessors, (1768), 0 states have call successors, (0), 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-12 10:05:58,830 INFO L186 Difference]: Start difference. First operand has 235 places, 152 transitions, 1017 flow. Second operand 12 states and 1396 transitions. [2022-07-12 10:05:58,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 233 transitions, 2468 flow [2022-07-12 10:05:58,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 233 transitions, 1865 flow, removed 231 selfloop flow, removed 42 redundant places. [2022-07-12 10:05:58,941 INFO L242 Difference]: Finished difference. Result has 184 places, 148 transitions, 729 flow [2022-07-12 10:05:58,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=184, PETRI_TRANSITIONS=148} [2022-07-12 10:05:58,941 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 41 predicate places. [2022-07-12 10:05:58,941 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 148 transitions, 729 flow [2022-07-12 10:05:58,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.22222222222223) internal successors, (1010), 9 states have internal predecessors, (1010), 0 states have call successors, (0), 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-12 10:05:58,942 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:58,942 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, 1, 1] [2022-07-12 10:05:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 10:05:58,942 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-12 10:05:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1553183235, now seen corresponding path program 1 times [2022-07-12 10:05:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544117205] [2022-07-12 10:05:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:05:59,058 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-12 10:05:59,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:05:59,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544117205] [2022-07-12 10:05:59,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544117205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:05:59,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:05:59,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:05:59,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830361860] [2022-07-12 10:05:59,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:05:59,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:05:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:05:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:05:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:05:59,062 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-07-12 10:05:59,062 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 148 transitions, 729 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 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-12 10:05:59,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:05:59,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-07-12 10:05:59,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:05:59,593 INFO L129 PetriNetUnfolder]: 633/2275 cut-off events. [2022-07-12 10:05:59,593 INFO L130 PetriNetUnfolder]: For 7141/7527 co-relation queries the response was YES. [2022-07-12 10:05:59,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7504 conditions, 2275 events. 633/2275 cut-off events. For 7141/7527 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 20353 event pairs, 42 based on Foata normal form. 44/2178 useless extension candidates. Maximal degree in co-relation 7410. Up to 365 conditions per place. [2022-07-12 10:05:59,612 INFO L132 encePairwiseOnDemand]: 130/136 looper letters, 32 selfloop transitions, 1 changer transitions 59/201 dead transitions. [2022-07-12 10:05:59,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 201 transitions, 1423 flow [2022-07-12 10:05:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:05:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:05:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-07-12 10:05:59,613 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8623949579831933 [2022-07-12 10:05:59,614 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-07-12 10:05:59,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-07-12 10:05:59,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:05:59,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-07-12 10:05:59,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 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-12 10:05:59,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12 10:05:59,617 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 0 states have call successors, (0), 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-12 10:05:59,617 INFO L186 Difference]: Start difference. First operand has 184 places, 148 transitions, 729 flow. Second operand 7 states and 821 transitions. [2022-07-12 10:05:59,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 201 transitions, 1423 flow [2022-07-12 10:05:59,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 201 transitions, 1164 flow, removed 71 selfloop flow, removed 27 redundant places. [2022-07-12 10:05:59,657 INFO L242 Difference]: Finished difference. Result has 164 places, 137 transitions, 471 flow [2022-07-12 10:05:59,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=471, PETRI_PLACES=164, PETRI_TRANSITIONS=137} [2022-07-12 10:05:59,658 INFO L279 CegarLoopForPetriNet]: 143 programPoint places, 21 predicate places. [2022-07-12 10:05:59,658 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 137 transitions, 471 flow [2022-07-12 10:05:59,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 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-12 10:05:59,659 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:05:59,659 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, 1, 1] [2022-07-12 10:05:59,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 10:05:59,659 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-12 10:05:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:05:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1022768591, now seen corresponding path program 2 times [2022-07-12 10:05:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:05:59,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891653083] [2022-07-12 10:05:59,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:05:59,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:05:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:05:59,703 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:05:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:05:59,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:05:59,781 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:05:59,782 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-07-12 10:05:59,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-07-12 10:05:59,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-07-12 10:05:59,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-07-12 10:05:59,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-07-12 10:05:59,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-07-12 10:05:59,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-07-12 10:05:59,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 10:05:59,785 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:05:59,790 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:05:59,790 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:05:59,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:05:59 BasicIcfg [2022-07-12 10:05:59,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:05:59,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:05:59,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:05:59,981 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:05:59,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:05:30" (3/4) ... [2022-07-12 10:05:59,983 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:06:00,112 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:06:00,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:06:00,114 INFO L158 Benchmark]: Toolchain (without parser) took 31061.93ms. Allocated memory was 100.7MB in the beginning and 9.6GB in the end (delta: 9.5GB). Free memory was 65.3MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-12 10:06:00,114 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:06:00,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.34ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 60.8MB in the end (delta: 4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 57.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,115 INFO L158 Benchmark]: Boogie Preprocessor took 34.69ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 55.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,115 INFO L158 Benchmark]: RCFGBuilder took 1148.47ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 55.8MB in the beginning and 91.4MB in the end (delta: -35.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,115 INFO L158 Benchmark]: TraceAbstraction took 29193.90ms. Allocated memory was 125.8MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 91.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-12 10:06:00,116 INFO L158 Benchmark]: Witness Printer took 132.11ms. Allocated memory is still 9.6GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 10:06:00,118 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.34ms. Allocated memory is still 100.7MB. Free memory was 65.1MB in the beginning and 60.8MB in the end (delta: 4.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 100.7MB. Free memory was 60.8MB in the beginning and 57.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.69ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 55.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1148.47ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 55.8MB in the beginning and 91.4MB in the end (delta: -35.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 29193.90ms. Allocated memory was 125.8MB in the beginning and 9.6GB in the end (delta: 9.4GB). Free memory was 91.4MB in the beginning and 8.4GB in the end (delta: -8.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 132.11ms. Allocated memory is still 9.6GB. Free memory was 8.4GB in the beginning and 8.4GB in the end (delta: 36.7MB). 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 __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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] [L846] 0 pthread_t t577; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577={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] [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-3, t577={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] [L848] 0 pthread_t t578; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={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] [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=-2, t577={5:0}, t578={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] [L850] 0 pthread_t t579; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={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] [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=-1, t577={5:0}, t578={6:0}, t579={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] [L852] 0 pthread_t t580; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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=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] [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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=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] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L824] 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) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 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 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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] [L857] 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] 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) [L859] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 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 [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L870] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={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] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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: 853]: 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: 847]: 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: 851]: 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: 849]: 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, 172 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.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1146 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1146 mSDsluCounter, 862 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1688 mSDsCounter, 385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2868 IncrementalHoareTripleChecker+Invalid, 3253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 385 mSolverCounterUnsat, 159 mSDtfsCounter, 2868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1589occurred in iteration=14, InterpolantAutomatonStates: 224, 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, 2.6s InterpolantComputationTime, 1858 NumberOfCodeBlocks, 1858 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1734 ConstructedInterpolants, 0 QuantifiedInterpolants, 9563 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-12 10:06:00,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE